中文
相关论文

相关论文: Infinite Sum-Product Configurations in Parallel

200 篇论文

We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from each other.

组合数学 · 数学 2023-08-25 James Davies

We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word $w$, does there exist a finite coloring of its factors such that no factorization of $w$ is monochromatic? We show that such a coloring…

组合数学 · 数学 2013-01-23 Aldo de Luca , Elena V. Pribavkina , Luca Q. Zamboni

A majority coloring of an undirected graph is a vertex coloring in which for each vertex there are at least as many bi-chromatic edges containing that vertex as monochromatic ones. It is known that for every countable graph a majority…

离散数学 · 计算机科学 2024-06-07 Bartłomiej Bosek , Aleksander Katan

We prove and generalize some recent conjectures of Z.-W. Sun on infinite series whose summands involve products of harmonic numbers and several binomial coefficients. We evaluate various classes of infinite sums in closed form by…

数论 · 数学 2026-03-10 Yajun Zhou

We study the preservation of certain properties under products of classes of finite structures. In particular, we examine indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We…

逻辑 · 数学 2023-09-14 Vince Guingona , Miriam Parnes , Lynn Scow

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…

组合数学 · 数学 2010-02-03 Rene P. Felix , Manuel Joseph C. Loquias

We give explicit examples of pairs of one-ended, open 4-manifolds whose end-sums yield uncountably many manifolds with distinct proper homotopy types. This answers strongly in the affirmative a conjecture of Siebenmann regarding the…

代数拓扑 · 数学 2020-11-19 Jack S. Calcut , Craig R. Guilbault , Patrick V. Haggerty

This is the second paper devoted to construction of finitely presented infinite nil semigroup with identity $x^9=0$. This construction answers to the problem of Lev Shevrin and Mark Sapir. In the first part we constructed the sequence of…

环与代数 · 数学 2022-06-23 Ilya Ivanov-Pogodaev , Alexey Kanel-Belov

We introduce and study a multiparameter colored partition category $\mathcal{CPar}(\textbf{x})$ by extending the construction of the partition category, over an algebraically closed field $\Bbbk$ of characteristic zero and for a…

表示论 · 数学 2022-05-31 Volodymyr Mazorchuk , Shraddha Srivastava

A finite or infinite matrix $A$ is image partition regular provided that whenever $\mathbb{N}$ is finitely colored, there must be some $\overset{\rightarrow}{x}$ with entries from $\mathbb{N}$ such that all entries of $A…

组合数学 · 数学 2018-04-04 Sukrit Chakraborty , Sourav Kanti Patra

Using an elementary identity, we prove that for infinitely many polynomials $P(x)\in \mathbb{Z}[X]$ of fourth degree, the equation $\prod\limits_{k=1}^{n}P(k)=y^2$ has finitely many solutions in $\mathbb{Z}$. We also give an example of a…

数论 · 数学 2017-08-01 Konstantinos Gaitanas

An ultraproduct can be a helpful organizing principle in presenting solutions of problems at many levels, as argued by Terence Tao. We apply it here to the solution of a calculus problem: every infinite sequence has a monotone infinite…

经典分析与常微分方程 · 数学 2018-05-11 Piotr Blaszczyk , Vladimir Kanovei , Mikhail G. Katz , Tahl Nowik

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

组合数学 · 数学 2013-09-03 Anthony Bonato , Dejan Delic

We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution.…

数论 · 数学 2025-08-14 Hlib Husarov , Eberhard Mayerhofer

We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…

群论 · 数学 2024-08-28 Jung Won Cho , Victoria Gould , Nik Ruškuc , Dandan Yang

We study the problem of determining whether a given temporal specification can be implemented by a symmetric system, i.e., a system composed from identical components. Symmetry is an important goal in the design of distributed systems,…

计算机科学中的逻辑 · 计算机科学 2017-10-17 Ruediger Ehlers , Bernd Finkbeiner

One of the toughest problems in Ramsey theory is to determine the existence of monochromatic arithmetic progressions in groups whose elements have been colored. We study the harder problem to not only determine the existence of…

组合数学 · 数学 2014-11-11 Erik Sjöland

Let $P$ be a set of $n$ points in the plane, not all on a line, each colored \emph{red} or \emph{blue}. The classical Motzkin--Rabin theorem guarantees the existence of a \emph{monochromatic} line. Motivated by the seminal work of Green and…

组合数学 · 数学 2026-02-20 Sujoy Bhore , Konrad Swanepoel

We construct for every integer $k\geq 3$ and every real $\mu\in(0, \frac{k-1}{k})$ a set of integers $X=X(k, \mu)$ which, when coloured with finitely many colours, contains a monochromatic $k$-term arithmetic progression, whilst every…

组合数学 · 数学 2024-10-08 Christian Reiher , Vojtěch Rödl , Marcelo Sales

We consider a category of finite crystals of a quantum affine algebra whose objects are not necessarily perfect, and set of paths, semi-infinite tensor product of an object of this category with a certain boundary condition. It is shown…

量子代数 · 数学 2007-05-23 Goro Hatayama , Yoshiyuki Koga , Atsuo Kuniba , Masato Okado , Taichiro Takagi