Related papers: Rationally almost periodic sequences, polynomial m…
To appear in Theory and Practice of Logic Programming (TPLP). Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling…
We develop an analytic approach that draws on tools from Fourier analysis and ergodic theory to study Ramsey-type problems involving sums and products in the integers. Suppose $Q$ denotes a polynomial with integer coefficients. We establish…
Let $\mathbb K$ be a perfect field of characterstic $p\ge 0$ and let $R\in \mathbb K(x)$ be a rational function. This paper studies the number $\Delta_{\alpha, R}(n)$ of distinct solutions of $R^{(n)}(x)=\alpha$ over the algebraic closure…
A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a…
Real-world phenomena can often be conveniently described by dynamical systems (that is, ODE systems in the state-space form). However, if one observes the state of the system only partially, the observed quantities (outputs) and the inputs…
From some observations on the linear differential operators occurring in the Lattice Green function of the d-dimensional face centred and simple cubic lattices, and on the linear differential operators occurring in the n-particle…
Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…
Models based on partial differential equations (PDEs) are powerful for describing a wide range of complex phenomena in the natural sciences. Accurately identifying the PDE model, which represents the underlying physical law, is essential…
The paper proves sum-of-square-of-rational-function based representations (shortly, sosrf-based representations) of polynomial matrices that are positive semidefinite on some special sets: $\mathbb{R}^n;$ $\mathbb{R}$ and its intervals…
Let $(X,T)$ be a topological dynamical system. Given a continuous vector-valued function $F \in C(X, \mathbb{R}^{d})$ called a potential we define its rotation set $R(F)$ as the set of integrals of $F$ with respect to all $T$-invariant…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…
A rotational subset, relative to a continuous transformation $T: \mathbb{T} \to \mathbb{T}$ on the unit circle, is a closed, invariant subset of $\mathbb{T}$ that is minimal and on which $T$ respects the standard orientation of the unit…
Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…
It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…
Kurokawa and Koyama's multiple cosine function $\mathcal{C}_{r}(x)$ and Kurokawa's multiple sine function $S_{r}(x)$ are generalizations of the classical cosine and sine functions from their infinite product representations, respectively.…
We show that if all collections of infinite subsets of $\N$ have the Ramsey property, then there are no infinite maximal almost disjoint (mad) families. This solves a long-standing problem going back to Mathias \cite{mathias}. The proof…
In this work we give a full characterization of sets of multiple polynomial recurrence in Weyl systems, which are ergodic unipotent affine transformations on products of tori and finite abelian groups. In particular, we show that measurable…
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…