Related papers: Recurrence for pretentious systems along generaliz…
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…
Let $(G,\pmb{+})$ be any given semimodule over a discrete semiring $(R,+,\cdot)$ with a finite coloring, say $G=B_1\cup\dotsm\cup B_q$. By establishing a Regional Multiple Recurrence Theorem for semimodules, we prove that one of the colors…
A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…
In this paper, we study a Ramsey-type problem for equations of the form $ax+by=p(z)$. We show that if certain technical assumptions hold, then any 2-colouring of the positive integers admits infinitely many monochromatic solutions to the…
The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…
Partially ordered sets have received much attention in recent years, not just due to their usefulness in combinatorics and abstract algebra, but also due to their practical applications in fields ranging from chemistry to macroeconomics.…
Suppose that $\mathbb{N}$ is $2$-coloured. Then there are infinitely many monochromatic solutions to $x + y = z^2$. On the other hand, there is a $3$-colouring of $\mathbb{N}$ with only finitely many monochromatic solutions to this…
We study systems of functional equations whose solutions can be parameterized in function of one variable; our main result proves that the partition regularity (PR) of such systems can be completely characterized by the existence of…
One of the key problems in dealing with color in rendering, shading, compositing, or image manipulation is that we do not have algebraic structures that support operations over colors. In this paper, we present an all-encompassing framework…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
It is shown that Pythagorean triples can be used to generate matrices that have integer eigenvalues for all permutations of their coefficients, via simple formulas. For example, each and every permutation of the $2\times2$ matrix…
We present a short ultrafilter proof of the existence of monochromatic exponential triples $\{a, b, b^a\}$ in any finite coloring of the natural numbers. The proof is given from scratch and uses only Ramsey's theorem, the notion of…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
This paper shows that guarded systems of recursive equations have unique solutions up to strong bisimilarity for any process algebra with a structural operation semantics in the ready simulation format. A similar result holds for simulation…
Introducing the notion of a rational system of measure preserving transformations and proving a recurrence result for such systems, we give sufficient conditions in order a subset of rational numbers to contain arbitrary long arithmetic…
Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…
Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…
We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial values and real number coefficients in the bit-model of real computation. We show…
We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…
In this paper we develop in detail the geometric constructions that lead to many uniqueness results for the determination of polyhedral sets, typically scatterers, by a finite minimal number of measurements. We highlight how unique…