Publications associées à Sigma additivité

Performance guarantees for greedy maximization of non-submodular controllability metrics

A key problem in emerging complex cyber-physical networks is the design of information and control topologies, including sensor and actuator selection and communication network design. These problems can be posed as combinatorial set function optimization ...

IEEE2019

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

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, Shakhar Smorodinsky

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

Combinatorial Penalties: Which structures are preserved by convex relaxations?

Volkan Cevher, Marwa El Halabi

We consider the homogeneous and the non-homogeneous convex relaxations for combinatorial penalty functions defined on support sets. Our study identifies key differences in the tightness of the resulting relaxations through the notion of the lower combinato ...

2017

Families with no s pairwise disjoint sets

Andrei Kupavskii

For integers n >= s >= 2 let e (n, s) denote the maximum of vertical bar F vertical bar, where F is a family of subsets of an n- element set and F contains no s pairwise disjoint members. Half a century ago, solving a conjecture of Erd. os, Kleitman determ ...

Wiley2017

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

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

The algebra of essential relations on a finite set

Jacques Thévenaz, Serge Bouc

Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called inessential rel ...

Walter de Gruyter2016

Sigma additivité

Graph Chatbot

Chattez avec Graph Search

Performance guarantees for greedy maximization of non-submodular controllability metrics

Dynamic Optimization of Reaction Systems via Exact Parsimonious Input Parameterization

Correspondence functors and finiteness conditions

Distinct distances between points and lines

Combinatorial Penalties: Which structures are preserved by convex relaxations?

Families with no s pairwise disjoint sets

On some algebraic and extremal problems in discrete geometry

Small subset sums

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

The algebra of essential relations on a finite set

Small subset sums

Performance guarantees for greedy maximization of non-submodular controllability metrics

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

Dynamic Optimization of Reaction Systems via Exact Parsimonious Input Parameterization

Correspondence functors and finiteness conditions

Families with no s pairwise disjoint sets

Distinct distances between points and lines

Combinatorial Penalties: Which structures are preserved by convex relaxations?

On some algebraic and extremal problems in discrete geometry

The algebra of essential relations on a finite set