Related papers: On Variable-Bounded Non-Linear Expansions of Presb…

In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…

We give a quantifier elimination procedure for one-parametric Presburger arithmetic, the extension of Presburger arithmetic with the function $x \mapsto t \cdot x$, where $t$ is a fixed free variable ranging over the integers. This resolves…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+. This…

For an arbitrary evolution family, we consider the notion of a polynomial dichotomy with respect to a family of norms and characterize it in terms of the admissibility property, that is, the existence of a unique bounded solution for each…

Limiting cases are studied of the Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials. We recover recently and not so recently introduced families of hypergeometric orthogonal polynomials in several variables…

Let $\mathbb{F}_p$ be a prime field of order $p>2$, and $A$ be a set in $\mathbb{F}_p$ with very small size in terms of $p$. In this note, we show that the number of distinct cubic distances determined by points in $A\times A$ satisfies…

Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable…

In this short note we show that if we add predicate for a dense complete indiscernible sequence in a dependent theory then the result is still dependent. This answers a question of Baldwin and Benedikt and implies that every unstable…

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

We study a nonlinear, nonlocal eigenvalue problem driven by the fractional p-Laplacian with an indefinite, singular weight chosen in an optimal class. We prove the existence of an unbounded sequence of positive variational eigenvalues and…