English
Related papers

Related papers: Finding Product and Sum Patterns in non-commutativ…

200 papers

We consider the problem of finding sum of squares (sos) expressions to establish the non-negativity of a symmetric polynomial over a discrete hypercube whose coordinates are indexed by the $k$-element subsets of $[n]$. For simplicity, we…

Combinatorics · Mathematics 2016-08-09 Annie Raymond , James Saunderson , Mohit Singh , Rekha R. Thomas

A semidomain is a subsemiring of an integral domain. We call a semidomain $S$ additively reduced if $0$ is the only invertible element of the monoid $(S, +)$, while we say that $S$ is additively Furstenberg if every non-invertible element…

Commutative Algebra · Mathematics 2024-12-24 Eddy Li , Advaith Mopuri , Charles Zhang

A well-known consequence of Schur's theorem is that for $r\in \mathbb{N}$, if $n$ is sufficiently large, then any $r$-colouring of $[n]$ results in monochromatic $a,b,c\in [n]$ such that $ab=c$. In this paper we are interested in the…

Combinatorics · Mathematics 2026-01-15 Roger Lidón , Darío Martínez , Patrick Morris , Miquel Ortega

The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…

Combinatorics · Mathematics 2023-01-24 Simone Costa , Stefano Della Fiore , M. A. Ollis

For each indifference graph, there is an associated regular semisimple Hessenberg variety, whose cohomology recovers the chromatic symmetric function of the graph. The decomposition theorem applied to the forgetful map from the regular…

Algebraic Geometry · Mathematics 2023-04-24 Alex Abreu , Antonio Nigro

Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…

Combinatorics · Mathematics 2015-08-11 Aldo de Luca , Luca Q. Zamboni

Hindman's Theorem (HT) states that for every coloring of $\mathbb N$ with finitely many colors, there is an infinite set $H \subseteq \mathbb N$ such that all nonempty sums of distinct elements of $H$ have the same color. The investigation…

Let $\mathbb{P}= \{P_1, \cdots, P_{k}\in \mathbb{R}[y]\}$ be a collection of polynomials with distinct degrees and zero constant terms. We proved that there exists $\epsilon=\epsilon(\mathbb{P})>0$ such that, for any compact set $E \subset…

Classical Analysis and ODEs · Mathematics 2025-07-22 Guo-Dong Hong

Noncommutative invariant theory is a generalization of the classical invariant theory of the action of $SL(2,\IC)$ on binary forms. The dimensions of the spaces of invariant noncommutative polynomials coincide with the numbers of certain…

Combinatorics · Mathematics 2012-12-06 Franz Lehner

We show that for $m, r \in \mathbb{N}$ and $N > (2m+1)^r (r!)^{1/m}$, every $r$-coloring of the integers in the interval $[N]$ contains a monochromatic solution to the equation \[ x_1 + \dots + \dots x_{m+1} = y_1 + \dots + y_m. \] This…

Combinatorics · Mathematics 2026-05-15 Rafael Miyazaki , Eion Mulrenin , Cosmin Pohoata , Michael Zheng

R. Jin showed that whenever A and B are sets of integers having positive upper Banach density, the sumset A+B is piecewise syndetic. This result was strengthened by Bergelson, Furstenberg, and Weiss to conclude that A+B must be piecewise…

Dynamical Systems · Mathematics 2010-11-02 John T. Griesmer

We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs, i.e., $x,y\in \mathbb{N}$ such that $x^2\pm y^2=z^2$ for some $z\in…

Combinatorics · Mathematics 2025-02-19 Nikos Frantzikinakis , Oleksiy Klurman , Joel Moreira

If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…

Combinatorics · Mathematics 2010-02-03 Rene P. Felix , Manuel Joseph C. Loquias

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

We say that a symmetric noncommutative polynomial in the noncommutative free variables (x_1, x_2, ..., x_g) is noncommutative plurisubharmonic on a noncommutative open set if it has a noncommutative complex hessian that is positive…

Operator Algebras · Mathematics 2011-01-17 Jeremy M. Greene

We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is…

Logic · Mathematics 2022-06-28 Amitayu Banerjee , Zalán Gyenis

We obtain a combinatorial formula related to the shear transformation for semi-invariants of binary forms, which implies the classical characterization of semi-invariants in terms of a differential operator. Then, we present a combinatorial…

Combinatorics · Mathematics 2021-09-15 William Y. C. Chen , Ivy D. D. Jia

We show that Sarnak's conjecture on M\"obius disjointness holds in every uniquely ergodic modelof a quasi-discrete spectrum automorphism. A consequence of this result is that, for each non constant polynomial $P\in\R[x]$ with irrational…

Dynamical Systems · Mathematics 2015-07-16 El Houcein El Abdalaoui , Mariusz Lemanczyk , Thierry De La Rue

A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…

Combinatorics · Mathematics 2013-12-20 Ben Barber , Neil Hindman , Imre Leader

A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…

Combinatorics · Mathematics 2017-07-07 Mehtaab Sawhney , David Stoner