Publications associées à Couple (mathématiques)

Pivot, process for manufacturing such a pivot, oscillator comprising such a pivot, watch movement and timepiece comprising such an oscillator

Simon Nessim Henein, Loïc Benoît Tissot-Daguette

The present invention concerns a pivot comprising two assemblies, namely a central assembly (401) and a peripheral assembly (400). These two assemblies are mobile in rotation relative to each other around an axis of rotation (A). The pivot is characterized ...

2024

Simultaneous Generation of Methyl Esters and CO in Lignin Transformation

Paul Joseph Dyson, Mingyang Liu

Lignin is an abundant renewable carbon source. Due to its complex structure, utilization of lignin is very challenging. Herein, we describe an efficient strategy for the simultaneous utilization of lignin, in which the methoxy groups in lignin react with c ...

Wiley-VCH Verlag GmbH2022

Packing the Boolean lattice with copies of a poset

Istvan Tomon

The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...

WILEY2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

On the Number of Containments in P-free Families

Abhishek Methuku

A subfamily {F-1, F-2, ..., F-vertical bar P vertical bar} subset of F is a copy of the poset P if there exists a bijection i : P -> {F-1, F-2, ..., F-vertical bar P vertical bar}, such that p

Springer2019

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Vehicle Having a High Clearing Capability

Thomas Estier

The invention relates to a vehicle which includes at least four wheels and a base. Said wheels are attached in pairs at the base via connections and form a bogie consisting of a pair of wheels. Said bogies are rotatably hinged onto the base such that the p ...

2017

Early-stage decision making approach for the selection of optimally integrated biorefinery processes

François Maréchal, Adriano Viana Ensinas, Shivom Sharma, Ayse Dilan Celebi

Lignocellulosic biorefineries are the best non-petroleum alternatives for a sustainable development. In the biorefinery process design, it is important to implement an algorithm that allows the systematic generation and the evaluation of energy conversion ...

2017

Multiple-field based code generator and decoder for communications systems

Mohammad Amin Shokrollahi, Lorenz Minder

A method of encoding data for transmission from a source to a destination over a communications channel is provided. The method operates on an ordered set of input symbols and includes generating a plurality of redundant symbols from the input symbols base ...

2016

Double-Normal Pairs In Space

János Pach

A double-normal pair of a finite set S of points that spans R-d is a pair of points {p, q} from S such that S lies in the closed strip bounded by the hyperplanes through p and q perpendicular to pq. A double-normal pair {p, q} is strict if S \ {p,q} lies i ...

London Mathematical Society, Cambridge2015