English
Related papers

Related papers: Stability and exact Turan numbers for matroids

200 papers

Tur\'an number is one of primary topics in the combinatorics of finite sets,in this paper, we will present a new upper bound for Tur\'an number.

Combinatorics · Mathematics 2011-10-25 An-Ping Li

Let $F$ be a strictly balanced $r$-uniform hypergraph with $e>2$ edges and $r$-density $m$. We give a new short proof of the fact that the Tur\'an number $\ex(n, F)$ is greater than $c\, n^{r-1/m} (\log n)^{1/(e-1)}$ where $c$ depends only…

Combinatorics · Mathematics 2017-11-01 Dhruv Mubayi

Model order reduction (MOR) is often applied to spatially-discretized partial differential equations to reduce their order and hence decrease computational complexity. A reduced system can be obtained, e.g., by time-limited balanced…

Optimization and Control · Mathematics 2019-07-15 Martin Redmann

Let $g$ be a Riemannian metric for $\mathbf{R}^d$ ($d\geq 3$) which differs from the Euclidean metric only in a smooth and strictly convex bounded domain $M$. The lens rigidity problem is concerned with recovering the metric $g$ inside $M$…

Differential Geometry · Mathematics 2017-02-28 Gang Bao , Hai Zhang

A collection of distinct sets is called a sunflower if the intersection of any pair of sets equals the common intersection of all the sets. Sunflowers are fundamental objects in extremal set theory with relations and applications to many…

Combinatorics · Mathematics 2021-10-25 Domagoj Bradač , Matija Bucić , Benny Sudakov

The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…

Optimization and Control · Mathematics 2018-06-27 Carlo Alberto De Bernardi , Enrico Miglierina , Elena Molho

The AMD-stability criterion allows to discriminate between a-priori stable planetary systems and systems for which the stability is not granted and needs further investigations. AMD-stability is based on the conservation of the Angular…

Earth and Planetary Astrophysics · Physics 2017-11-08 Antoine C. Petit , Jacques Laskar , Gwenaël Boué

We prove a strong inapproximability result for the Balanced Minimum Evolution Problem. Our proof also implies that the problem remains NP-hard even when restricted to metric instances. Furthermore, we give a MST-based 2-approximation…

Data Structures and Algorithms · Computer Science 2012-01-31 Samuel Fiorini , Gwenaël Joret

We show that the stability problem and the problem of constructing Barabanov norms can be resolved for planar linear switching systems in an explicit form. This can be done for every compact control set of $2 \times 2$ matrices. If the…

Functional Analysis · Mathematics 2025-06-23 Vladimir Yu. Protasov , Asiiat Musaeva

There are many interesting dynamical systems in which degenerate invariant tori appear. We give conditions under which these degenerate tori have stable and unstable invariant manifolds, with stable and unstable directions having arbitrary…

Dynamical Systems · Mathematics 2024-01-12 Immaculada Baldomá , Ernest Fontich , Pau Martín

The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…

General Mathematics · Mathematics 2026-02-05 Angshuman R. Goswami , Mahmood K. Shihab

We develop Stein's method for $\alpha$-stable approximation with $\alpha\in(0,1]$, continuing the recent line of research by Xu \cite{lihu} and Chen, Nourdin and Xu \cite{C-N-X} in the case $\alpha\in(1,2).$ The main results include an…

Probability · Mathematics 2019-04-16 Peng Chen , Ivan Nourdin , Lihu Xu , Xiaochuan Yang , Rui Zhang

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

Classical Analysis and ODEs · Mathematics 2024-06-17 Paige Bright , Caleb Marshall

In the following we consider a 2-dimensional system of ODE's containing quasiperiodic terms. The system is proposed as an extension of Mathieu-type equations to higher dimensions, with emphasis on how resonance between the internal…

Dynamical Systems · Mathematics 2012-03-13 Thomas Waters

The oriented Tur\'{a}n number of a given oriented graph $\overrightarrow{F}$, denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in $n$-vertex $\overrightarrow{F}$-free oriented graphs. This parameter could be seen as a…

Combinatorics · Mathematics 2026-02-17 Xuanrui Hu , Yuefang Sun

Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…

Rings and Algebras · Mathematics 2025-07-11 Tomer Bauer , Guy Blachar , Be'eri Greenfeld

The Dowling geometry $Q_n(\Gamma)$, where $\Gamma$ is a finite group, is a matroid that generalizes the complete-graphic matroid $M(K_{n+1})$. We determine the maximum size of an $N$-free submatroid of $Q_n(\Gamma)$ for various choices of…

Combinatorics · Mathematics 2025-11-25 Rutger Campbell , Donggyu Kim , Jorn van der Pol

We resolve several longstanding problems concerning the stability and the absence of multi-particle binding for N\geq 2 polarons. Fr\"ohlich's 1937 polaron model describes non-relativistic particles interacting with a scalar quantized field…

Strongly Correlated Electrons · Physics 2015-03-17 Rupert L. Frank , Elliott H. Lieb , Robert Seiringer , Lawrence E. Thomas

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

Combinatorics · Mathematics 2026-02-24 Peter Frankl , Hongliang Lu , Jie Ma , Yuze Wu