Related papers: Positivity of arbitrary-order P-recursive sequence…
We recall the definition and the properties of a moment sequence and recall that all real sequences that have a finite rank of its Hankel matrix (see definition in the sequel) satisfy a homogeneous linear equation with constant…
We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.
We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.
A criterion for the HNN-extension of a finite p-group to be residually a finite p-group is obtained and based on this criterion the sufficient condition for residuality a finite p-group of HNN-extension with arbitrary base group is proved.…
Measuring how quickly iterative methods converge is essential in computational mathematics, but current approaches have significant limitations. Q-order analysis requires strict smoothness conditions, while R-order analysis lacks precision…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
We use multivariate total positivity theory to exhibit new families of peacocks. As the authors of \cite{HPRY}, our guiding example is the result of Carr-Ewald-Xiao \cite{CEX}. We shall introduce the notion of strong conditional…
Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…
Shumyatsky and the second author proved that if G is a finitely generated residually finite p-group satisfying a law, then, for almost all primes, the fact that a normal and commutator-closed set of generators satisfies a positive law…
The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…
We consider the uniqueness of solutions of ordinary differential equations where the coefficients may have singularities. We derive upper bounds on the the order of singularities of the coefficients and provide examples to illustrate the…
Consider a discrete-time optimal selection problem where one observes a sequence of independent Bernoulli trials and receives a nonnegative reward upon stopping on a success. The aim is to find a single-choice strategy that maximises the…
We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an n-1-element p-basis of its ring of constants. In the case of two variables we characterize these…
Let $G$ be a finite group and let $p$ be a prime. In this paper, we study the structure of finite groups with a large number of $p$-regular conjugacy classes or, equivalently, a large number of irreducible $p$-modular representations. We…
We are interested in solutions of a norm form equation that takes values in a given multi-recurrence. We show that among the solutions there are only finitely many values in each component which lie in the given multi-recurrence unless the…
We study rationality properties of irreducible characters of finite groups. We show that the continuity of $2$-rationality is a phenomenon that can be detected in the principal $2$-block, thus refining a recent result of N. N. Hung. We also…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We describe the roots of the Bernstein-Sato polynomial of a monomial ideal using reduction mod p and invariants of singularities in positive chracteristic. We give in this setting a positive answer to a problem of Takagi, Watanabe and the…