English
Related papers

Related papers: Inhomogeneous Partition Regularity

200 papers

Perfect colourings of the rings of cyclotomic integers with class number one are studied. It is shown that all colourings induced by ideals (q) are chirally perfect, and vice versa. A necessary and sufficient condition for a colouring to be…

Group Theory · Mathematics 2012-02-22 E. P. Bugarin , M. L. A. N. de las Peñas , D. Frettlöh

We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.

Number Theory · Mathematics 2007-05-23 Ernest S. Croot

A graph $G$ is said to be perfectly divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A, B$ such that $H[A]$ is perfect and $\omega(B) < \omega(H)$. It is easy…

Combinatorics · Mathematics 2026-05-12 Hongzhang Chen , Kaiyang Lan , Wenlong Zhong

Let V, W be real algebraic varieties (that is, up to isomorphism, real algebraic sets), and let X be a subset of V. A map f from X into W is said to be regular if it can be extended to a regular map defined on some Zariski locally closed…

Algebraic Geometry · Mathematics 2017-05-15 Wojciech Kucharz

A partition $(V_1,\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL…

Data Structures and Algorithms · Computer Science 2018-08-13 Laurent Bulteau , Konrad K. Dabrowski , Guillaume Fertin , Matthew Johnson , Daniel Paulusma , Stephane Vialette

Given an integer $n$, we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts in $\{1,2,\dots, n-1\}$. Starting from an abelian subring, we…

Combinatorics · Mathematics 2023-03-10 Riccardo Aragona , Roberto Civino , Norberto Gavioli

We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…

Dynamical Systems · Mathematics 2026-05-22 Kai Diethelm , Safoura Hashemishahraki

The values of the normalized homogeneous weight are determined for arbitrary finite Frobenius rings and expressed in a form that is independent from a generating character and the M\"obius function on the ring. The weight naturally induces…

Information Theory · Computer Science 2014-03-19 Heide Gluesing-Luerssen

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

Rings and Algebras · Mathematics 2021-05-05 Loïc Foissy

Let $R$ be a commutative ring with non-zero identity. The cozero-divisor graph of $R$, denoted by $\Gamma^{\prime}(R)$, is a graph with vertices in $W^*(R)$, which is the set of all non-zero and non-unit elements of $R$, and two distinct…

Combinatorics · Mathematics 2018-04-24 R. Nikandish , M. J. Nikmehr , M. Bakhtyiari

We study a class of square matrices with non-negative elements which have cyclically monotone rows in the sense that each row of a matrix from the class consists of a cyclically non-increasing sequence of numbers starting from a maximal…

Number Theory · Mathematics 2026-04-27 Pavel Šťovíček , Edita Pelantová

A commutative ring R is said to be coverable if it is the union of its proper subrings and said to be finitely coverable if it is the union of a finite number of them. In the latter case, we denote by {\sigma}(R) the minimal number of…

Number Theory · Mathematics 2024-07-01 Mohamed Ayad , Omar Kihel

In this paper we consider the following question in the spirit of Ramsey theory: Given $x\in A^\omega,$ where $A$ is a finite non-empty set, does there exist a finite coloring of the non-empty factors of $x$ with the property that no…

Combinatorics · Mathematics 2014-03-26 Aldo de Luca , Elena V. Pribavkina , Luca Q. Zamboni

We establish multiple recurrence results for pretentious measure-preserving multiplicative actions along generalized Pythagorean triples, that is, solutions to the equation $ax^2 + b y^2 = c z^2$. This confirms the ergodic-theoretic form of…

Dynamical Systems · Mathematics 2025-08-26 Nikos Frantzikinakis , Andreas Mountakis

In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…

Discrete Mathematics · Computer Science 2022-06-06 Jarkko Kari , Etienne Moutot

We show that if $(X,\mu)$ is a standard probability space, then every $\mu$-preserving $\aleph_0$-regular Borel graph on $X$ admits a $\mu$-measurable vertex $\aleph_0$-coloring in which every vertex sees every color in its neighborhood.

Logic · Mathematics 2025-10-15 Edward Hou

We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…

Optimization and Control · Mathematics 2021-10-05 Alexander Barvinok , Mark Rudelson

For $n$-by-$n$ and $m$-by-$m$ complex matrices $A$ and $B$, it is known that the inequality $w(A\otimes B)\le\|A\|w(B)$ holds, where $w(\cdot)$ and $\|\cdot\|$ denote, respectively, the numerical radius and the operator norm of a matrix. In…

Functional Analysis · Mathematics 2013-10-22 Hwa-Long Gau , Kuo-Zhong Wang , Pei Yuan Wu

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

Number Theory · Mathematics 2020-10-20 Adriana L. Duncan , Simran Khunger , Holly Swisher , Ryan Tamura

A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number of a graph G, denoted by \chi_b(G), is the maximum number t such that G admits a…

Computational Complexity · Computer Science 2023-04-04 Flavia Bonomo , Oliver Schaudt , Maya Stein , Mario Valencia-Pabon