English
Related papers

Related papers: Linear Algebraic Method and the Erd\H{o}s-Heilbron…

200 papers

Given a Legendrian knot $\Lambda \subset \mathbb{R}^3$ and a vertical line dividing the front projection of $\Lambda$ into two halves, we construct a differential graded algebra associated to each half-knot. We then show that one may obtain…

Symplectic Geometry · Mathematics 2025-09-10 Maciej Wlodek

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Combinatorics · Mathematics 2021-04-05 Elisa Palezzato , Michele Torielli

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hypergraphs. Using initial monomials, projections of the…

Combinatorics · Mathematics 2021-11-22 Alex Scott , Elizabeth Wilmer

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

In the framework of nonlinear Hamiltonian lattices, we revisit the proof of Moser-Darboux's Theorem, in order to present a general scheme for its constructive applicability to Hamiltonian models with non-standard symplectic structures. We…

Mathematical Physics · Physics 2024-05-08 Marco Calabrese , Simone Paleari , Tiziano Penati

Given a fixed hypergraph $H$, let $\mbox{wsat}(n,H)$ denote the smallest number of edges in an $n$-vertex hypergraph $G$, with the property that one can sequentially add the edges missing from $G$, so that whenever an edge is added, a new…

Combinatorics · Mathematics 2021-11-04 Asaf Shapira , Mykhaylo Tyomkyn

We establish nontrivial bounds for general bilinear forms with a given periodic function, which are thought of as an analogue of van der Corput differencing for exponential sums. The proof employs Poisson summation, Cauchy-Schwarz, and the…

Number Theory · Mathematics 2023-12-06 Ikuya Kaneko

We formulate a conjecture classifying algebraic solutions to (possibly non-linear) algebraic differential equations, in terms of the primes appearing in the denominators of the coefficients of their Taylor expansion at a non-singular point.…

Algebraic Geometry · Mathematics 2025-01-24 Yeuk Hay Joshua Lam , Daniel Litt

We give a quintet of proofs resulting from questions posed by Erd\H{o}s. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any…

Combinatorics · Mathematics 2026-04-09 Boris Alexeev , Moe Putterman , Mehtaab Sawhney , Mark Sellke , Gregory Valiant

We introduce an algebra model to study higher order sum rules for orthogonal polynomials on the unit circle. We build the relation between the algebra model and sum rules, and prove an equivalent expression on the algebra side for the sum…

Spectral Theory · Mathematics 2017-08-24 Jun Yan

The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and…

Logic in Computer Science · Computer Science 2014-01-22 Matthias Heizmann , Jochen Hoenicke , Jan Leike , Andreas Podelski

In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…

Combinatorics · Mathematics 2012-08-14 Benjamin Girard

A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…

Logic · Mathematics 2020-02-27 Almudena Colacito , Nikolaos Galatos , George Metcalfe

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

Numerical Analysis · Mathematics 2025-10-20 Uwe Naumann

We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.

Combinatorics · Mathematics 2019-05-07 Shahram Mohsenipour

The aim of this article is to obtain variations on the classical theorems of Schur and Baer on finiteness of commutator subgroups, valid in the contexts of Lie algebras and Leibniz algebras over a field. Using non-abelian tensor products…

Rings and Algebras · Mathematics 2023-12-12 Guram Donadze , Tim Van der Linden

Reider's Theorem on the very ampleness of adjoint linear series on a complex projective algebraic surface is extended in two new directions. First, Reider-type inequalities are shown to imply nefness of linear series of the form dH - E on…

Algebraic Geometry · Mathematics 2026-04-24 Aaron Bertram , Jonathon Fleck , Liebo Pan , Joseph Sullivan

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

Combinatorics · Mathematics 2021-11-29 János Nagy , Péter Pál Pach , István Tomon