English
Related papers

Related papers: Tropical Kirchhoff's Formula and Postoptimality in…

200 papers

Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important role in control theory, linear systems theory, and coding theory. It is a common practice to arrange the vectors of any minimal basis as…

Numerical Analysis · Mathematics 2016-12-13 Paul Van Dooren , Froilán M. Dopico

For a metric graph $G=(V,E)$ and $R\subset V$, the internal Steiner minimum tree problem asks for a minimum weight Steiner tree spanning $R$ such that every vertex in $R$ is not a leaf. This note shows a simple polynomial-time…

Data Structures and Algorithms · Computer Science 2013-07-18 Bang Ye Wu

We give conditions for minimality of $\mathbb Z/N\mathbb Z$ extensions of a rotation of angle $\alpha$ with one marked point, solving the problem for any prime $N$: for $N=2$, these correspond to the Veech 1969 examples, for which a…

Dynamical Systems · Mathematics 2021-03-17 Sébastien Ferenczi , Pascal Hubert

In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids $\mathcal M$ such that its corresponding toric ideal $I_{\mathcal M}$ is a complete intersection. Secondly, we…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge Luis Ramírez Alfonsín

The Kirchhoff model describes the statics and dynamics of thin rods within the approximations of the linear elasticity theory. In this paper we develop a method, based on a shooting technique, to find equilibrium configurations of finite…

Biological Physics · Physics 2016-08-16 Alexandre F. da Fonseca , Marcus A. M. de Aguiar , .

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Combinatorics · Mathematics 2020-08-04 Matthew Baker , Oliver Lorscheid

For systems of $N$ charged fermions (e.g. electrons) interacting with longitudinal optical quantized lattice vibrations of a polar crystal we derive upper and lower bounds on the minimal energy within the model of H. Fr\"ohlich. The only…

Mathematical Physics · Physics 2015-05-13 Marcel Griesemer , Jacob Schach Møller

This paper investigates the use of the most fundamental elements; cables for tension and bars for compression, in the search for the most efficient bridges. Stable arrangements of these elements are called tensegrity structures. We show…

Materials Science · Physics 2014-12-18 Gerardo Carpentieri , Robert E. Skelton , Fernando Fraternali

The Tutte equations are ported (or set-pointed) when the equations F(N) = g_e F(N/e) + r_e F(N\e) are omitted for elements e in a distinguished set called ports. Solutions F can distinguish different orientations of the same matroid. A…

Combinatorics · Mathematics 2007-05-23 Seth Chaiken

We consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important…

Data Structures and Algorithms · Computer Science 2018-11-20 Alina Ene , Huy L. Nguyen

Tree-reweighted max-product (TRW) message passing is a modified form of the ordinary max-product algorithm for attempting to find minimal energy configurations in Markov random field with cycles. For a TRW fixed point satisfying the strong…

Artificial Intelligence · Computer Science 2012-07-09 Vladimir Kolmogorov , Martin Wainwright

Let $M$ be a matroid on a set $E$ and let $w:E\longrightarrow G$ be a weight function, where $G$ is a cyclic group. Assuming that $w(E)$ satisfies the Pollard's Condition (i.e. Every non-zero element of $w(E)-w(E)$ generates $G$), we obtain…

Combinatorics · Mathematics 2009-03-05 Y. O. Hamidoune , I. P. da Silva

We show that a simple rank-$r$ matroid with no $(t+1)$-element independent flat has at least as many elements as the matroid $M_{r,t}$ defined as the direct sum of $t$ binary projective geometries whose ranks pairwise differ by at most $1$.…

Combinatorics · Mathematics 2020-11-13 Peter Nelson , Sergey Norin

The Monge-Kantorovich transportation problem involves optimizing with respect to a given a cost function. Uniqueness is a fundamental open question about which little is known when the cost function is smooth and the landscapes containing…

Probability · Mathematics 2010-08-27 Najma Ahmad , Hwa Kil Kim , Robert J. McCann

We consider the problem of finding an independent set of maximum weight simultaneously contained in $k$ matroids over a common ground set. This $k$-matroid intersection problem appears naturally in many contexts, for example in generalizing…

Data Structures and Algorithms · Computer Science 2024-12-10 Neta Singer , Theophile Thiery

Motivated by the problem of optimal portfolio liquidation under transient price impact, we study the minimization of energy functionals with completely monotone displacement kernel under an integral constraint. The corresponding minimizers…

Optimization and Control · Mathematics 2018-08-15 Alexander Schied , Elias Strehle

In this article, we consider vibrational systems with semi-active damping that are described by a second-order model. In order to minimize the influence of external inputs to the system response, we are optimizing some damping values. As…

Dynamical Systems · Mathematics 2023-05-23 Jennifer Przybilla , Igor Pontes Duff , Peter Benner

For a matroid $M$, an element $e$ such that both $M\backslash e$ and $M/e$ are regular is called a regular element of $M$. We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small…

Combinatorics · Mathematics 2015-09-15 Sandra Kingan , Manoel Lemos

This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring. We introduce and compare three natural definitions of the rank of a matrix, called the Barvinok rank, the Kapranov rank and the…

Combinatorics · Mathematics 2007-05-23 M. Develin , F. Santos , B. Sturmfels

Matroid intersection is one of the most powerful frameworks of matroid theory that generalizes various problems in combinatorial optimization. Edmonds' fundamental theorem provides a min-max characterization for the unweighted setting,…

Data Structures and Algorithms · Computer Science 2023-02-07 Kristóf Bérczi , Tamás Király , Yutaro Yamaguchi , Yu Yokoi
‹ Prev 1 4 5 6 7 8 10 Next ›