English
Related papers

Related papers: On the metastable Mabillard-Wagner conjecture

200 papers

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…

Combinatorics · Mathematics 2018-08-09 Pierre-Yves Bienvenu , Thái Hoàng Lê

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Combinatorics · Mathematics 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

We construct an oracle relative to which $\mathrm{P} = \mathrm{NP} \cap \mathrm{coNP}$, but there are no many-one complete sets in $\mathrm{UP}$, no many-one complete disjoint $\mathrm{NP}$-pairs, and no many-one complete disjoint…

Computational Complexity · Computer Science 2022-03-22 Anton Ehrmanntraut , Fabian Egidy , Christian Glaßer

Let $\theta$ be a Bernoulli measure which is stationary for a random walk generated by finitely many contracting rational affine dilations of $\mathbb{R}^d$, and let $\mathcal{K} = \mathrm{supp}(\theta)$ be the corresponding attractor. An…

Dynamical Systems · Mathematics 2025-02-28 Osama Khalil , Manuel Luethi , Barak Weiss

We give a proof of the planar case of a longstanding conjecture of Kneser (1955) and Poulsen (1954). In fact, we prove more by showing that if a finite set of disks in the plane is rearranged so that the distance between each pair of…

Metric Geometry · Mathematics 2007-05-23 Károly Bezdek , Robert Connelly

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

Combinatorics · Mathematics 2019-12-19 Jakub Przybyło

We introduce a notion of cross-flips: local moves that transform a balanced (i.e., properly $(d+1)$-colored) triangulation of a combinatorial $d$-manifold into another balanced triangulation. These moves form a natural analog of bistellar…

Combinatorics · Mathematics 2017-08-31 Ivan Izmestiev , Steven Klee , Isabella Novik

Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t+1}$ minor, then its vertex set $V(G)$ can be partitioned into $t$ stable sets. This is still open, but we prove under the same hypotheses that $V(G)$ can be partitioned…

Combinatorics · Mathematics 2015-12-24 Katherine Edwards , Dong Yeap Kang , Jaehoon Kim , Sang-il Oum , Paul Seymour

We give a counterexample to a conjecture of D.H. Gottlieb and prove a strengthened version of it. The conjecture says that a map from a finite CW-complex X to an aspherical CW-complex Y with non-zero Euler characteristic can have…

Algebraic Topology · Mathematics 2014-10-01 Thomas Schick , Andreas Thom

A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…

Combinatorics · Mathematics 2025-10-17 Sergey Fomin , Andrei Zelevinsky

Assume $\lambda=\{k_1,k_2, \ldots, k_q\}$ is a partition of $k_{\lambda} = \sum_{i=1}^q k_i$. A $\lambda$-list assignment of $G$ is a $k_\lambda$-list assignment $L$ of $G$ such that the colour set $\bigcup_{v \in V(G)}L(v)$ can be…

Combinatorics · Mathematics 2022-09-16 Yangyan Gu , Yiting Jiang , David R. Wood , Xuding Zhu

We consider the following conjecture (from Huang, et al): Let $\Delta^+$ denote the upper half disc in $\mathbb{C}$ and let $\gamma = ( - 1, 1)$ (viewed as an interval in the real axis in $\mathbb{C}$). Assume that $F$ is a holomorphic…

Complex Variables · Mathematics 2015-08-13 Abtin Daghighi , Steven G. Krantz

In this paper, we mainly prove some results on the additivity of maps over rings under certain conditions. First, we discuss a special case of MARTINDALE III's theorem of \cite{1969M} as a bijective map $\varphi$ over a ring $R$ with a…

Rings and Algebras · Mathematics 2025-10-07 Sk Aziz , Arindam Ghosh , Om Prakash

We propose a 'geometric Chevalley-Warning' conjecture, that is a motivic extension of the Chevalley-Warning theorem in number theory. It is equivalent to a particular case of a recent conjecture of F. Brown and O.Schnetz. In this paper, we…

Algebraic Geometry · Mathematics 2017-10-19 Xia Liao

In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the…

General Mathematics · Mathematics 2009-04-23 I. Cahit

In this paper, we study relative deformations of maps into a family of K\"ahler manifolds whose images are divisors. We show that if the map satisfies a condition called semiregularity, then it allows relative deformations if and only if…

Algebraic Geometry · Mathematics 2020-09-04 Takeo Nishinou

For a disk $D$ in the plane $\mathbb R^2$ and a plane map $f$, we give several conditions on the restriction of $f$ to the boundary $\partial D$ of $D$ which imply the existence of a fixed point of $f$ in some specified domain in $D$. These…

Dynamical Systems · Mathematics 2024-02-27 Jiehua Mai , Enhui Shi , Kesong Yan , Fanping Zeng

The "topological Tverberg conjecture" by B\'ar\'any, Shlosman and Sz\H{u}cs (1981) states that any continuous map of a simplex of dimension $(r-1)(d+1)$ to $\mathbb{R}^d$ maps points from $r$ disjoint faces of the simplex to the same point…

Combinatorics · Mathematics 2020-06-02 Florian Frick

A famous conjecture of Ryser is that in an $r$-partite hypergraph the covering number is at most $r-1$ times the matching number. If true, this is known to be sharp for $r$ for which there exists a projective plane of order $r-1$. We show…

Combinatorics · Mathematics 2015-12-31 Ron Aharoni , János Barát , Ian M. Wanless

A 1992 conjecture of Alon and Spencer says, roughly, that the ordinary random graph $G_{n,1/2}$ typically admits a covering of a constant fraction of its edges by edge-disjoint, nearly maximum cliques. We show that this is not the case. The…

Combinatorics · Mathematics 2017-06-07 Huseyin Acan , Jeff Kahn
‹ Prev 1 4 5 6 7 8 10 Next ›