English
Related papers

Related papers: Shadows and intersections: stability and new proof…

200 papers

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…

Discrete Mathematics · Computer Science 2020-04-22 Julien Bensmail , Hervé Hocquard , Dimitri Lajou , Eric Sopena

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…

Combinatorics · Mathematics 2017-07-31 Jan Hladký , János Komlós , Diana Piguet , Miklós Simonovits , Maya J. Stein , Endre Szemerédi

Light-front coordinates offer a scenario in which a constituent picture of hadron structure can emerge from QCD, after several difficulties are addressed. Field theoretic difficulties force us to introduce cutoffs that violate Lorentz…

High Energy Physics - Theory · Physics 2008-02-03 Robert J. Perry

In this paper, we report several new geometric and Lyapunov characterizations of incrementally stable systems on Finsler and Riemannian manifolds. A new and intrinsic proof of an important theorem in contraction analysis is given via the…

Systems and Control · Electrical Eng. & Systems 2022-11-17 Dongjun Wu , Guangren Duan

In this paper, we prove a limit set intersection theorem in relatively hyperbolic groups. Our approach is based on a study of dynamical quasiconvexity of relatively quasiconvex subgroups. Using dynamical quasiconvexity, many well-known…

Group Theory · Mathematics 2011-03-18 Wen-yuan Yang

A connected matching in a graph $G$ is a matching contained in a connected component of $G$. A well-known method due to {\L}uczak reduces problems about monochromatic paths and cycles in complete graphs to problems about monochromatic…

Combinatorics · Mathematics 2022-04-22 Shoham Letzter

Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…

General Topology · Mathematics 2017-09-13 Oliver Tatton-Brown

In this paper we show how some known weak forms of the Zilber--Pink conjecture can be strengthened by combining them with the Mordell--Lang conjecture or its variants. We illustrate this idea by proving some theorems on atypical…

Number Theory · Mathematics 2021-06-04 Vahagn Aslanyan

We consider the stability issue of the inverse conductivity problem for a conformal class of anisotropic conductivities in terms of the local Dirichlet-to-Neumann map. We extend here the stability result obtained by Alessandrini and…

Analysis of PDEs · Mathematics 2016-11-04 Romina Gaburro , Eva Sincich

By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbations, we assign to each homology class of the intersection its…

Computational Geometry · Computer Science 2010-04-22 Herbert Edelsbrunner , Dmitriy Morozov , Amit Patel

In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…

Artificial Intelligence · Computer Science 2011-10-12 R. H. C. Yap , Y. Zhang

We introduce a strong notion of quasiconvexity in finitely generated groups, which we call stability. Stability agrees with quasiconvexity in hyperbolic groups and is preserved under quasi-isometry for finitely generated groups. We show…

Geometric Topology · Mathematics 2015-11-25 Matthew Gentry Durham , Samuel J. Taylor

An important family of structural constants in the theory of symmetric functions and in the representation theory of symmetric groups and general linear groups are the plethysm coefficients. In 1950, Foulkes observed that they have some…

Combinatorics · Mathematics 2015-05-15 Laura Colmenarejo

Motivated by the counting results for color-critical subgraphs by Mubayi [Adv. Math., 2010], we study the phenomenon behind Mubayi's theorem from a spectral perspective and start up this problem with the fundamental case of triangles. We…

Combinatorics · Mathematics 2023-02-16 Bo Ning , Mingqing Zhai

We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…

Combinatorics · Mathematics 2015-10-14 Vitaly Bergelson , Joel Moreira

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

Combinatorics · Mathematics 2024-04-17 Alan Yan

The relationship between the perturbation theory in light-front coordinates and Lorentz-covariant perturbation theory is investigated. A method for finding the difference between separate terms of the corresponding series without their…

High Energy Physics - Theory · Physics 2008-11-26 S. A. Paston , V. A. Franke

We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…

Functional Analysis · Mathematics 2014-02-26 A. Koldobsky , G. Paouris , M. Zymonopoulou

We give another proof, using tools from Geometric Invariant Theory, of a result due to S. Sam and A. Snowden in 2014, concerning the stability of Kro-necker coefficients. This result states that some sequences of Kronecker coefficients…

Representation Theory · Mathematics 2018-04-16 Maxime Pelletier

Let S(n) be the symmetric group on n points. A subset S of S(n) is intersecting if for any pair of permutations \pi, \sigma in S there is a point i in {1,...,n} such that \pi(i)=\sigma(i). Deza and Frankl \cite{MR0439648} proved that if S a…

Combinatorics · Mathematics 2007-10-12 Chris Godsil , Karen Meagher