English
Related papers

Related papers: The bunkbed conjecture remains true when gluing al…

200 papers

The generalized gluing and resmoothing theorem originally proved by LeClair, Peskin and Preitschopf, gives a powerful formula for the fused vertex obtained by contracting any two vertices in string field theories. Although the theorem is…

High Energy Physics - Theory · Physics 2009-10-31 Tsuguhiko Asakawa , Taichiro Kugo , Tomohiko Takahashi

Graph burning is a discrete time process which can be used to model the spread of social contagion. One is initially given a graph of unburned vertices. At each round (time step), one vertex is burned; unburned vertices with at least one…

Combinatorics · Mathematics 2023-12-25 Yukihiro Murakami

We analyze the realm of validity of the recently found tachyon solution of cubic string field theory. We find that the equation of motion holds in a non trivial way when this solution is contracted with itself. This calculation is needed to…

High Energy Physics - Theory · Physics 2008-11-26 Ehud Fuchs , Michael Kroyter

The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.

Combinatorics · Mathematics 2017-10-31 Arthur Hoffmann-Ostenhof , Tomáš Kaiser , Kenta Ozeki

Two conjectures recently proposed by one of the authors are disproved

Metric Geometry · Mathematics 2011-05-25 P. G. L. Porta Mana , P. G. Lewis

This paper takes a new step in the direction of proving the Duffin-Schaeffer Conjecture for measures arbitrarily close to Lebesgue. The main result is that under a mild `extra divergence' hypothesis, the conjecture is true.

Number Theory · Mathematics 2012-01-06 Victor Beresnevich , Glyn Harman , Alan Haynes , Sanju Velani

We propose the conjecture that every graph $G$ of order $n$ with less than $3n-6$ edges has a vertex cut that induces a forest. Maximal planar graphs do not have such vertex cuts and show that the density condition would be best possible.…

Combinatorics · Mathematics 2024-09-27 Vsevolod Chernyshev , Johannes Rauch , Dieter Rautenbach

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…

Combinatorics · Mathematics 2011-01-14 Bojan Mohar

In this short paper we will show, via elementary arguments, the equivalence of the Twin Prime Conjecture to a problem which might be simpler to prove. Some conclusions are drawn, and it is shown that proving the Twin Prime Conjecture is…

General Mathematics · Mathematics 2011-07-01 F. Balestrieri

As already observed by Gabriel, coherent sheaves on schemes obtained by gluing affine open subsets can be described by a simple gluing construction. An example due to Ferrand shows that this fails in general for pushouts along closed…

Algebraic Geometry · Mathematics 2015-05-19 Daniel Schäppi

We provide further evidence to favor the fact that rank-one convexity does not imply quasiconvexity for two-component maps in dimension two. We provide an explicit family of maps parametrized by $\tau$, and argue that, for small $\tau$,…

Optimization and Control · Mathematics 2019-04-02 Pablo Pedregal

The slope conjecture gives a precise relation between the degree of the colored Jones polynomial of a knot and the boundary slopes of essential surfaces in the knot complement. In this note we propose a generalization of the slope…

Geometric Topology · Mathematics 2015-01-15 Roland van der Veen

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

Computational Geometry · Computer Science 2016-03-28 Markus Geyer , Michael Hoffmann , Michael Kaufmann , Vincent Kusters , Csaba D. Tóth

In [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with…

Combinatorics · Mathematics 2017-07-26 Yingzhi Tian , Jixiang Meng , Hong-Jian Lai , Liqiong Xu

We prove the Forking Path Conjecture for all but one element in the symmetric group $S_4$. Two specific paths in the rex graph of that element give a counterexample for the conjecture. We propose a refined conjecture for the longest element…

Representation Theory · Mathematics 2023-08-08 Gonzalo Jiménez

We study the relationship between Iitaka fibrations and the conjecture on the existence of complements, assuming the good minimal model conjecture. In one direction, we show that the conjecture on the existence of complements implies the…

Algebraic Geometry · Mathematics 2023-01-13 Guodu Chen , Jingjun Han , Jihao Liu

We propose a variant of the effective adjunction conjecture for lc-trivial fibrations. This variant is suitable for inductions and can be used to treat real coefficients.

Algebraic Geometry · Mathematics 2020-07-09 Zhan Li

We prove a connexity theorem for abelian varieties in characteristic $0$: if $X$ is an abelian variety and $V\rightarrow X$ and $W\rightarrow X$ two morphisms, then, under certain hypotheses, the fiber product of $V$ and $W$ over $X$ is…

alg-geom · Mathematics 2008-02-03 Olivier Debarre

We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…

Number Theory · Mathematics 2015-03-13 Zhi-Wei Sun

Let X be a complex surface with no nontrivial 2-forms. Then we show that Bloch's conjecture is true (i.e. the Albanese map in this case is injective) if and only if any homologically trivial idempotent in the ring of correspondences…

Algebraic Geometry · Mathematics 2007-05-23 Morihiko Saito