English
Related papers

Related papers: A simple solution to the Braga-Mello conjecture

200 papers

We resolve a conjecture of Cox and Martin by determining asymptotically for every $k\ge 2$ the maximum number of copies of $C_{2k}$ in an $n$-vertex planar graph.

Combinatorics · Mathematics 2022-06-09 Zequn Lv , Ervin Győri , Zhen He , Nika Salia , Casey Tompkins , Xiutao Zhu

In 2000, Enomoto and Ota conjectured that if a graph $G$ satisfies $\sigma_{2}(G) \geq n + k - 1$, then for any set of $k$ vertices $v_{1}, \dots, v_{k}$ and for any positive integers $n_{1}, \dots, n_{k}$ with $\sum n_{i} = |G|$, there…

Combinatorics · Mathematics 2014-08-05 Vincent Coll , Alexander Halperin , Colton Magnant , Pouria Salehi Nowbandegani

Strongly-coupled fermionic systems can support a variety of low-energy phenomena, giving rise to collective condensation, symmetry breaking and a rich phase structure. We explore the potential of worldline Monte Carlo methods for analyzing…

High Energy Physics - Theory · Physics 2010-11-11 Gerald Dunne , Holger Gies , Klaus Klingmuller , Kurt Langfeld

We consider smooth families of planar polynomial vector fields $\{X_\mu\}_{\mu\in\Lambda}$, where $\Lambda$ is an open subset of $\mathbb{R}^N$, for which there is a hyperbolic polycycle $\Gamma$ that is persistent (i.e., such that none of…

Dynamical Systems · Mathematics 2023-06-28 David Marín , Lucas Queiroz , Jordi Villadelprat

Beginning with the Bell theorem, cyclic systems of dichotomous random variables have been the object of many foundational findings in quantum mechanics. Here, we ask the question: if one chooses a cyclic system "at random" (uniformly within…

Quantum Physics · Physics 2021-04-14 Ehtibar N. Dzhafarov , Janne V. Kujala , Víctor H. Cervantes

If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…

Combinatorics · Mathematics 2015-07-08 János Pach , Natan Rubin , Gábor Tardos

Consider the graph that has as vertices all bitstrings of length $2n+1$ with exactly $n$ or $n+1$ entries equal to 1, and an edge between any two bitstrings that differ in exactly one bit. The well-known middle levels conjecture asserts…

Combinatorics · Mathematics 2018-05-21 Petr Gregor , Torsten Mütze , Jerri Nummenpalo

Prompted by results of Guardo, Van Tuyl and the second author for lines in projective 3 space, we develop asymptotic upper bounds for the least degree of a homogeneous form vanishing to order at least m on a union of disjoint r dimensional…

Algebraic Geometry · Mathematics 2016-04-12 Marcin Dumnicki , Brian Harbourne , Tomasz Szemberg , Halszka Tutaj-Gasińska

P\'or and Wood conjectured that for all $k,l \ge 2$ there exists $n \ge 2$ with the following property: whenever $n$ points, no $l + 1$ of which are collinear, are chosen in the plane and each of them is assigned one of $k$ colours, then…

Combinatorics · Mathematics 2014-10-13 Vytautas Gruslys

Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<\gamma_2<\gamma_1<1$ are two fixed constants. In this paper, it is proved that, whenever $\alpha$…

Number Theory · Mathematics 2026-05-05 Junyi Chu , Jinjiang Li , Min Zhang

We conjecture that the exceptional set in Manin's Conjecture has an explicit geometric description. Our proposal includes the rational point contributions from any generically finite map with larger geometric invariants. We prove that this…

Algebraic Geometry · Mathematics 2022-04-08 Brian Lehmann , Akash Kumar Sengupta , Sho Tanimoto

We study equilibrium configurations of infinitely many identical particles on the real line or finitely many particles on the circle, such that the (repelling) force they exert on each other depends only on their distance. The main question…

Classical Analysis and ODEs · Mathematics 2016-04-11 Agelos Georgakopoulos , Mihail N. Kolountzakis

The group of piecewise projective homeomorphisms of the line provides straightforward counter-examples to the so-called von Neumann conjecture. The examples are so simple that many additional properties can be established.

Group Theory · Mathematics 2013-09-10 Nicolas Monod

Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of simple cycles on the digraph. Cartier and Foata have showed…

Combinatorics · Mathematics 2023-07-03 J. Fromentin , P. -L Giscard , T. Karaboghossian

In this work we are interested in the Demyanov--Ryabova conjecture for a finite family of polytopes. The conjecture asserts that after a finite number of iterations (successive dualizations), either a 1-cycle or a 2-cycle eventually comes…

Optimization and Control · Mathematics 2017-09-07 Aris Daniilidis , Colin Petitjean

We present here a fine singularity analysis of solutions to the Laplace equation in special polygonal domains in the plane. We assume piecewise constant Neumann on one component of the boundary. Our motivation is to find the rigorous proof…

Analysis of PDEs · Mathematics 2013-10-01 Adam Kubica , Piotr Rybka

The gauge symmetries of a general dynamical system can be systematically obtained following either a Hamiltonean or a Lagrangean approach. In the former case, these symmetries are generated, according to Dirac's conjecture, by the first…

High Energy Physics - Theory · Physics 2007-05-23 Heinz J. Rothe , Klaus D. Rothe

Motivated by problems arising in geometric flows, we prove several regularity results for systems of local and nonlocal equations, adapting to the parabolic case a neat argument due to Caffarelli. The geometric motivation of this work comes…

Analysis of PDEs · Mathematics 2020-05-11 Agnid Banerjee , Gonzalo Dávila , Yannick Sire

Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…

Combinatorics · Mathematics 2013-01-01 Robert Šámal

In this note, we show there exist infinitely many trajectories which are bi-normal (i.e. normal at initial and final times) to the xz-plane, in the Spatial Circular Restricted Three-Body Problem, for energies below or slightly above the…

Symplectic Geometry · Mathematics 2025-06-03 Agustin Moreno , Arthur Limoge