English
Related papers

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

200 papers

A cycle is algebraically trivial if it can be exhibited as the difference of two fibers in a family of cycles parameterized by a smooth scheme. Over an algebraically closed field, it is a result of Weil that it suffices to consider families…

Algebraic Geometry · Mathematics 2020-02-27 Jeff Achter , Sebastian Casalaina-Martin , Charles Vial

Let $\mathcal{P}$ be a set of $n$ points in the Euclidean plane. We prove that, for any $\epsilon > 0$, either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors determined by…

Combinatorics · Mathematics 2019-03-06 Ben Lund

We present a new solution for fundamental problems in nonlinear dynamical systems: finding, verifying, and stabilizing cycles. The solution we propose consists of a new control method based on mixing previous states of the system (or the…

Dynamical Systems · Mathematics 2017-12-19 D. Dmitrishin , I. E. Iacob , I. Skrinnik , A. Stokolos

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

Combinatorics · Mathematics 2007-05-23 Igor Rivin

Following Smale, we study simple symmetric mechanical systems of $n$ point particles in the plane. In particular, we address the question of the linear and spectral stability properties of relative equilibria, which are special solutions of…

Dynamical Systems · Mathematics 2014-04-18 Vivina Barutello , Riccardo D. Jadanza , Alessandro Portaluri

The Nakamura number is an appropriate invariant of a simple game to study the existence of social equilibria and the possibility of cycles. For symmetric quota games its number can be obtained by an easy formula. For some subclasses of…

Combinatorics · Mathematics 2018-11-30 Josep Freixas , Sascha Kurz

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…

Logic in Computer Science · Computer Science 2026-05-15 Mishel Carelli

This paper presents a criterion that provides an easy sufficient condition for a collection of line integrals to have the Chebyshev property. The condition is based on the functions appearing in the line integrals. The criterion is used to…

Dynamical Systems · Mathematics 2023-11-17 Ali Bakhshalizadeh , Alex C. Rezende

Gao, Huo, Liu and Ma (2019) proved a result on the existence of paths connecting specified two vertices whose lengths differ by one or two. By using this result, they settled two famous conjectures due to Thomassen (1983). In this paper, we…

Combinatorics · Mathematics 2020-08-25 Shuya Chiba , Katsuhiro Ota , Tomoki Yamashita

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Combinatorics · Mathematics 2015-03-20 Ben Green , Terence Tao

We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…

Computational Geometry · Computer Science 2024-01-25 Philip Todd

In this paper, we study rational sections of the relative Picard variety of a linear system on a smooth projective variety. Specifically, we prove that if the linear system is basepoint-free and the locus of non-integral divisors has…

Algebraic Geometry · Mathematics 2014-02-11 Matthew Woolf

A two-dimensional $n$-correct set is a set of nodes admitting unique bivariate interpolation with polynomials of total degree at most ~$n$. We are interested in correct sets with the property that all fundamental polynomials are products of…

Algebraic Geometry · Mathematics 2022-08-16 Hakop Hakopian , Gagik Vardanyan , Navasard Vardanyan

A linear equation is $r$-regular, if, for every $r$-coloring of the positive integers, there exist positive integers of the same color which satisfy the equation. In 2005, Fox and Radoicic conjectured that the equation $x_1 + 2x_2 + \cdots…

Combinatorics · Mathematics 2014-04-15 Noah Golowich

A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph $K_n$ admits a plane Hamiltonian cycle. It turned out that already the existence of much simpler non-crossing substructures in such drawings is hard to…

Computational Geometry · Computer Science 2026-03-17 Helena Bergold , Stefan Felsner , Meghana M. Reddy , Joachim Orthaber , Manfred Scheucher

Motivated by the work of Chudnovsky and the Eisenbud-Mazur Conjecture on evolutions, Harbourne and Huneke give a series of conjectures that relate symbolic and regular powers of ideals of fat points in $\mathbb P^n$. The conjectures involve…

Commutative Algebra · Mathematics 2014-04-01 Susan M. Cooper , Stephen G. Hartke

In 2019, Aharoni proposed a conjecture generalizing the Caceetta-H\"aggkvist conjecture: if an $n$-vertex graph $G$ admits an edge coloring (not necessarily proper) with $n$ colors such that each color class has size at least $r$, then $G$…

Combinatorics · Mathematics 2025-07-08 He Guo

We develop a method for proving the Boone--Higman Conjecture for groups acting on locally finite trees. As a consequence, we prove the Boone--Higman Conjecture for all Baumslag--Solitar groups and for all free(finite rank)-by-cyclic groups,…

Group Theory · Mathematics 2025-01-27 Kai-Uwe Bux , Claudio Llosa Isenrich , Xiaolei Wu

We prove Manin's conjecture for a split singular quartic del Pezzo surface with singularity type $2\Aone$ and eight lines. This is achieved by equipping the surface with a conic bundle structure. To handle the sum over the family of conics,…

Number Theory · Mathematics 2014-02-26 Daniel Loughran

We give a new simple geometric proof that any seven points in the plane have four Tverberg partitions into three sets. This is the only confirmed non-trivial case of Sierksma's conjecture. Earlier proofs, by Stephan Hell, relied on…

Combinatorics · Mathematics 2026-04-21 Pablo Soberón
‹ Prev 1 3 4 5 6 7 10 Next ›