Related papers: Quantitative Helly-type Theorems via Hypergraph Ch…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…
We establish a quantitative version of Oppenheim's conjecture for generic ternary indefinite quadratic forms using an analytic number theory approach. The statements come with power gains and in some cases are essentially optimal
We give a new proof of the Skeletal Lemma, which is the main technical tool in our paper on Hamilton cycles in line graphs [T. Kaiser and P. Vr\'ana, Hamilton cycles in 5-connected line graphs, European J. Combin. 33 (2012), 924-947]. It…
In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a novel hypergraph…
Families of translates and homothets of strictly convex curves are proven to possess Helly-type properties generalizing those of a circle. Weaker results are shown for arbitrary convex curves.
We investigate the statistical behaviors of 3D hairy black holes in the presence of a scalar field. The present study is made in terms of two relevant parameters: rotation parameter a and B parameter related to the scalar field. More…
We consider a holographic description of a system of strongly coupled fermions in 2+1 dimensions based on a D7-brane probe in the background of D3-branes, and construct stable embeddings by turning on worldvolume fluxes. We study the system…
We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most…
We show that for any fixed $\alpha>0$, cherry-quasirandom 3-graphs of positive density and sufficiently large order $n$ with minimum vertex degree $\alpha \binom n2$ have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and…
In this article, using methods from geometric analysis and theory of heat kernels, we derive qualitative estimates of automorphic cusp forms defined over quaternion algebras. Using which, we prove an average version of the holomorphic QUE…
We sketch the construction of a quantum model of 3 dimensional de Sitter space, based on the Covariant Entropy Principle and the observation that semi-classical physics suggests the possibility of a consistent theory of a finite number of…
The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asserts that the family of independent sets of every uniform…
Taking quantum formalism as a point of reference and connection, we explore the various possibilities that arise in the construction of physical theories. Analyzing the distinct physical phenomena that each of them may describe, we…
We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on…
Quantum $L_\infty$ algebras are a generalization of $L_\infty$ algebras with a scalar product and with operations corresponding to higher genus graphs. We construct a minimal model of a given quantum $L_\infty$ algebra via the homological…
The ball hypergraph of a graph $G$ is the family of balls of all possible centers and radii in $G$. It has Helly number at most $k$ if every subfamily of $k$-wise intersecting balls has a nonempty common intersection. A graph is $k$-Helly…
Covering arrays are combinatorial objects that have been successfully applied in the design of test suites for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their…
A fundamental problem in Ramsey theory is to determine the growth rate in terms of $n$ of the Ramsey number $r(H, K_n^{(3)})$ of a fixed $3$-uniform hypergraph $H$ versus the complete $3$-uniform hypergraph with $n$ vertices. We study this…
We prove a fractional Hardy-Rellich inequality with an explicit constant in bounded domains of class $C^{1,1}$. The strategy of the proof generalizes an approach pioneered by E. Mitidieri (Mat. Zametki, 2000) by relying on a Pohozaev-type…