Concept

Couple (mathématiques)

Publications associées (20)

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

Diameter Graphs in R-4

Andrei Kupavskii

A diameter graph in is a graph whose set of vertices is a finite subset of and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of different extremal properties of diameter graphs in and on a ...

Springer2014

Mirror Match: Reliable Feature Point Matching Without Geometric Constraints

Sabine Süsstrunk, Stefan Winkler

Many algorithms have been proposed to solve the problem of matching feature points in two or more images using geometric assumptions to increase the robustness of the matching. However, these assumptions do not always hold; in particular, few methods addre ...

2013

Small distances in convex polygons

Filip Moric

Let d(1) < d(2) < ... denote the set of all distances between two vertices of a convex n-gon. We show that the number of pairs of vertices at distance d(2) from one another is at most n + O(1). (C) 2013 Elsevier B.V. All rights reserved. ...

Elsevier2013

Adjacent Crossings Do Matter

Radoslav Fulek

In a drawing of a graph, two edges form an odd pair if they cross each other an odd number of times. A pair of edges is independent if they share no endpoint. For a graph G, let ocr(G) be the smallest number of odd pairs in a drawing of G and let iocr(G) b ...

Springer-Verlag Berlin2011

Alignment of uncalibrated images for multi-view classification

Pascal Frossard, Elif Vural, Ömer Sercan Arik

Efficient solutions for the classification of multi-view images can be built on graph-based algorithms when little information is known about the scene or cameras. Such methods typically require a pairwise similarity measure between images, where a common ...

2011

Order-adjoint monads and injective objects

Gavin Jay Seal

Given a monad T on Set whose functor factors through the category of ordered sets with left adjoint maps, the category of Kleisli monoids is defined as the category of monoids in the hom-sets of the Kleisli category of T. The Eilenberg-Moore category of T ...

Elsevier2010

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer2010

A bipartite strengthening of the Crossing Lemma

János Pach

Let G = (V, E) be a graph with n vertices and m >= 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Omega(m(3)/n(2)) pairs of crossing edges; or equivalently, there is an edge that crosses Omega(m(2)/n(2)) other edges. ...

2010

Jamming in granular media : modeling of experimental data

Michel Tsukahara

This thesis studies the phenomenon of jamming in granular media, such as when a salt shaker gets clogged. We use modern instrumentation, like X-ray synchrotron tomography, to look inside real jamming experiments. High performance computers allow simulating ...

EPFL2009

File download and streaming system

Mohammad Amin Shokrollahi

2008