Publications associées à Convexly independent subsets of the Minkowski sum of planar point sets

Publications associées (29)

Correspondence functors and duality

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. By means of a suitably defined duality, new correspondence functors are constructed, having remarkable p ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Early decoding of walking tasks with minimal set of EMG channels

Silvestro Micera

Objective. Powered lower-limb prostheses relying on decoding motor intentions from non-invasive sensors, like electromyographic (EMG) signals, can significantly improve the quality of life of amputee subjects. However, the optimal combination of high decod ...

IOP Publishing Ltd2023

Quadratic serendipity element shape functions on general planar polygons

Xiaodong Wei

This paper proposes a method for the construction of quadratic serendipity element (QSE) shape functions on planar convex and concave polygons. Existing approaches for constructing QSE shape functions are linear combinations of the pair-wise products of ge ...

ELSEVIER SCIENCE SA2022

Annihilation Filter Approach For Estimating Graph Dynamics From Diffusion Processes

Pascal Frossard, Arun Venkitaraman

We propose an approach for estimating graph diffusion processes using annihilation filters from a finite set of observations of the diffusion process made at regular intervals. Our approach is based on the key observation that a graph diffusion process can ...

IEEE2022

Positive moments for scattering amplitudes

Riccardo Rattazzi, Francesco Riva, Brando Bellazzini, Marc Riembau Saperas

We find the complete set of conditions satisfied by the forward 2 -> 2 scattering amplitude in unitary and causal theories. These are based on an infinite set of energy dependent quantities (the arcs) which are dispersively expressed as moments of a positi ...

American Physical Society2021

Deterministic error bounds for kernel-based learning techniques under bounded noise

Colin Neil Jones, Emilio Maddalena, Paul Scharnhorst

We consider the problem of reconstructing a function from a finite set of noise-corrupted samples. Two kernel algorithms are analyzed, namely kernel ridge regression and epsilon-support vector regression. By assuming the ground-truth function belongs to th ...

2021

Local invertibility and sensitivity of atomic structure-feature mappings

Michele Ceriotti, Sergey Pozdnyakov

Background: The increasingly common applications of machine-learning schemes to atomic-scale simulations have triggered efforts to better understand the mathematical properties of the mapping between the Cartesian coordinates of the atoms and the variety o ...

2021

Simple Realizability of Complete Abstract Topological Graphs Simplified

Jan Kyncl

An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...

SPRINGER2020

The algebra of Boolean matrices, correspondence functors, and simplicity

Jacques Thévenaz, Serge Bouc

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...

2020

Dynamic Optimization of Reaction Systems via Exact Parsimonious Input Parameterization

Dominique Bonvin, Diogo Filipe Mateus Rodrigues

This paper discusses the use of parsimonious input parameterization for the dynamic optimization of reaction systems. This parameterization is able to represent the optimal inputs with only a few parameters. In the context of batch, semibatch, and continuo ...

AMER CHEMICAL SOC2019

Characterization of local morphology and availability of triple-phase boundaries in solid oxide cell electrodes

Jan Van Herle, Marco Cantoni, Arata Nakajo, Pierre Burdet, Giorgio Rinaldi

The performance of solid oxide cells is known to be dependent upon the density of three phase boundaries (TPB), but the potential for improving their effective electrocatalytic activity by morphological adjustments is imprecisely known. A spilling algorith ...

2019

Simple and projective correspondence functors

Jacques Thévenaz, Serge Bouc

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. We determine exactly which simple correspondence functors are projective. We also determine which simple ...

2021

On reducing the number of decision variables for dynamic optimization

Dominique Bonvin, Diogo Filipe Mateus Rodrigues

This paper presents an input parameterization for dynamic optimization that allows reducing the number of decision variables compared to traditional direct methods. A small number of decision variables is likely to be beneficial for various applications su ...

2020

Correspondence functors and finiteness conditions

Jacques Thévenaz, Serge Bouc

We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties wh ...

2018

Distinct distances between points and lines

Frank de Zeeuw, Adrian Claudiu Valculescu

We show that for m points and n lines in R-2, the number of distinct distances between the points and the lines is Omega(m(1/5)n(3/5)), as long as m(1/2)

Elsevier Science Bv2018

Counting Intersecting and Pairs of Cross-Intersecting Families

Andrei Kupavskii

A family of subsets of {1, ... , n} is called intersecting if any two of its sets intersect. A classical result in extremal combinatorics due to Erdos, Ko and Rado determines the maximum size of an intersecting family of k-subsets of {1, ... , n}. In this ...

Cambridge Univ Press2018

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Enabling exact delay synthesis

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Mathias Soeken, Luca Gaetano Amarù

Given (i) a Boolean function, (ii) a set of arrival times at the inputs, and (iii) a gate library with associated delay values, the exact delay synthesis problem asks for a circuit implementation which minimizes the arrival time at the output(s). The exact ...

IEEE2017

Small subset sums

Gergely Ambrus

Let parallel to.parallel to be a norm in R-d whose unit ball is B. Assume that V subset of B is a finite set of cardinality n, with Sigma(v is an element of V) v = 0. We show that for every integer k with 0

Elsevier Science Inc2016

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016