English
Related papers

Related papers: On the metastable Mabillard-Wagner conjecture

200 papers

The global symmetry data of a $D$-dimensional absolute quantum field theory can sometimes be packaged in terms of a $(D+1)$-dimensional bulk system obtained by extending along an interval, with a relative QFT$_D$ at one end and suitable…

High Energy Physics - Theory · Physics 2025-12-23 Jonathan J. Heckman , Max Hübner , Chitraang Murdia

We show that every nearly spherical manifold can be realized as the volume-preserving image of a round sphere, via the Brenier-McCann optimal transport map. This theorem extends Caffarelli's contraction theorem to nearly spherical manifolds…

Analysis of PDEs · Mathematics 2025-12-02 Yuxin Ge , Jordan Serres

A simple consequence of a theorem of Franks says that whenever a continuous map, $g$, is homotopic to angle doubling on the circle it is semiconjugate to it. We show that when this semiconjugacy has one disconnected point inverse, then the…

Dynamical Systems · Mathematics 2007-05-23 Philip Boyland

In this paper we show the validity, under certain geometric conditions, of Wheeler's thin sandwich conjecture for higher dimensional theories of gravity. We extend the results shown by R. Bartnik and G. Fodor for the 3-dimensional case in…

General Relativity and Quantum Cosmology · Physics 2017-11-03 R. Avalos , F. Dahia , C. Romero , J. H. Lira

We prove the following theorem: Let X be a Stein manifold of dimension at least 2 and Y a closed complete pluripolar subset of X. Given a point p in the complement of Y there is a proper holomorphic map f from the unit disc to X such that…

Complex Variables · Mathematics 2007-05-23 Barbara Drinovec Drnovsek

We introduce the notion of r-defectivity for a vector bundle on a quasi-projective variety. Using this tool, we prove several previously unknown cases of Fr\"oberg's conjecture and also of the postulation problem for fat point schemes. Our…

Algebraic Geometry · Mathematics 2025-09-15 Alexander Blomenhofer , Alex Casarotti

Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…

Probability · Mathematics 2023-07-06 Enrique Alvarado , Bala Krishnamoorthy , Kevin R. Vixie

Given a group $G$, we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $|A+A| > |A-A|$, has more differences than sums (MDTS) if $|A+A| < |A-A|$, or is sum-difference balanced if $|A+A| = |A-A|$. A problem of recent…

Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…

Computational Geometry · Computer Science 2020-08-17 Uli Wagner , Emo Welzl

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

Combinatorics · Mathematics 2013-05-17 Henning Bruhn , Pierre Charbit , Oliver Schaudt , Jan Arne Telle

The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice $L$ with more than one element contains a…

Combinatorics · Mathematics 2025-03-04 Christopher Bouchard

The Cherednik-Orr conjecture expresses the $t\to\infty$ limit of the nonsymmetric Macdonald polynomials in terms of the PBW twisted characters of the affine level one Demazure modules. We prove this conjecture in several special cases.

Representation Theory · Mathematics 2014-07-24 Evgeny Feigin , Ievgen Makedonskyi

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

Combinatorics · Mathematics 2007-05-23 Christian Haase , Günter M. Ziegler

Using a probabilistic method, we prove that $d(d+1)$-connected graphs are rigid in $\mathbb{R}^d$, a conjecture of Lov\'asz and Yemini. Then, using recent results on weakly globally linked pairs, we modify our argument to prove that…

Combinatorics · Mathematics 2023-12-05 Soma Villányi

In this paper we study the ergodic properties of mathematical billiards describing the uniform motion of a point in a flat torus from which finitely many, pairwise disjoint, tubular neighborhoods of translated subtori (the so called…

Dynamical Systems · Mathematics 2010-08-12 Nandor Simanyi

We study the log-rank conjecture from the perspective of point-hyperplane incidence geometry. We formulate the following conjecture: Given a point set in $\mathbb{R}^d$ that is covered by constant-sized sets of parallel hyperplanes, there…

Combinatorics · Mathematics 2023-04-14 Noah Singer , Madhu Sudan

In this paper, we introduce the zero divisor graph of a multiplicative lattice. We provide a counter example to Beck's conjecture for multiplicative lattices. Further, we prove that Beck's conjecture is true for reduced multiplicative…

Commutative Algebra · Mathematics 2013-10-18 Vinayak Joshi , Sachin Sarode

The Monodromy Conjecture asserts that if c is a pole of the local topological zeta function of a hypersurface, then exp(2\pi i c) is an eigenvalue of the monodromy on the cohomology of the Milnor fiber. A stronger version of the conjecture…

Algebraic Geometry · Mathematics 2010-01-10 Nero Budur , Mircea Mustata , Zach Teitler

We consider the dynamics of `nonlinear tent maps': piecewise smooth unimodal maps with nowhere vanishing derivative. We show that if a nonlinear tent map $f$ is not infinitely renormalizable, then all its periodic orbits of sufficiently…

Dynamical Systems · Mathematics 2016-09-06 Ale Jan Homburg

A word $w$ of letters on edges of underlying graph $\Gamma$ of deterministic finite automaton (DFA) is called synchronizing if $w$ sends all states of the automaton to a unique state. J. \v{C}erny discovered in 1964 a sequence of $n$-state…

Discrete Mathematics · Computer Science 2022-01-19 A. N. Trahtman