English
Related papers

Related papers: New Obstacles to Multiple Recurrence

200 papers

Some easily verifiable sufficient conditions for the nonexistence of iterative roots for multifunctions on arbitrary nonempty sets are presented. Typically if the graph of the multifunction has a distinguished point with a relatively large…

Dynamical Systems · Mathematics 2022-12-13 B. V. Rajarama Bhat , Chaitanya Gopalakrishna

The categories with noninvertible morphisms are studied analogously to the semisupermanifolds with noninvertible transition functions. The concepts of regular n-cycles, obstruction and the regularization procedure are introduced and…

Mathematical Physics · Physics 2007-05-23 Steven Duplij , Wladyslaw Marcinek

The Graph Minor Theorem of Robertson and Seymour implies a finite set of obstructions for any minor closed graph property. We show that there are only three obstructions to knotless embedding of size 23, which is far fewer than the 92 of…

Geometric Topology · Mathematics 2024-05-02 Hyoungjun Kim , Thomas W. Mattman

In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…

Computational Complexity · Computer Science 2007-05-23 Ketan D Mulmuley , Milind Sohoni

In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. (*) Panchromatic Graphs: For fixed integer k, a k-panchromatic graph is, roughly speaking, a…

Computational Complexity · Computer Science 2021-11-11 Boris Bukh , Karthik C. S. , Bhargav Narayanan

In this paper we show a variant of colorful Tverberg's theorem which is valid in any matroid: Let $S$ be a sequence of non-loops in a matroid $M$ of finite rank $m$ with closure operator cl. Suppose that $S$ is colored in such a way that…

Combinatorics · Mathematics 2019-09-20 Pavel Paták

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…

Combinatorics · Mathematics 2021-03-09 Anshul Adve , Colleen Robichaux , Alexander Yong

In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords:…

Commutative Algebra · Mathematics 2013-11-01 Ivan Martino , Luca Martino

In "IP-sets and polynomial recurrence", Bergelson, Furstenberg, and McCutcheon established the following far reaching extension of Khintchine's recurrence theorem: For any invertible probability preserving system $(X,\mathcal A,\mu,T)$, any…

Dynamical Systems · Mathematics 2024-01-10 Rigoberto Zelada

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

Group Theory · Mathematics 2021-03-19 Emmanuel Rauzy

In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of…

Mathematical Physics · Physics 2010-12-07 Maria Simonetta Bernabei , Horst Thaler

We construct three new families of fibrations $\pi : S \to B$ where $S$ is an algebraic complex surface and $B$ a curve that violate Xiao's conjecture relating the relative irregularity and the genus of the general fiber. The fibers of…

Algebraic Geometry · Mathematics 2015-06-30 Alberto Albano , Gian Pietro Pirola

We show that recurrence conditions do not yield invariant Borel probability measures in the descriptive set-theoretic milieu, in the strong sense that if a Borel action of a locally compact Polish group on a standard Borel space satisfies…

Logic · Mathematics 2023-06-22 Manuel J. Inselmann , Benjamin D. Miller

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…

Combinatorics · Mathematics 2007-05-23 Jason P. Bell , Stefan Gerhold

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

Number Theory · Mathematics 2025-03-07 Alina Ostafe , Carl Pomerance , Igor E. Shparlinski

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau

We develop sufficient analytic conditions for recurrence and transience of non-sectorial perturbations of possibly non-symmetric Dirichlet forms on a general state space. These form an important subclass of generalized Dirichlet forms which…

Probability · Mathematics 2017-10-10 Minjung Gim , Gerald Trutnau

We revisit Akbulut and King's first example of a compact semialgebraic set which satisfies Sullivan's local Euler characteristic condition, but which is not homeomorphic to an algebraic set. A nontrivial obstruction is computed using the…

Algebraic Geometry · Mathematics 2012-02-15 Clint McCrory

In the paper, we search for monochromatic infinite additive structures involving polynomials over $\mathbb{N}$. It is proved that for any $r\in \mathbb{N}$, any two distinct natural numbers $a,b$, and any $2$-coloring of $\mathbb{N}$, there…

Combinatorics · Mathematics 2026-01-21 Zhengxing Lian , Rongzhong Xiao