Related papers: Inductive Methods and zero-sum free sequences

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of $]n[:= \{1,2,..., n\}$ such that elements of A are incongruent modulo p and non-zero modulo p. Let $k \geq…

We study zero-sum stochastic games for controlled discrete time Markov chains with risk-sensitive average cost criterion with countable state space and Borel action spaces. The payoff function is nonnegative and possibly unbounded. Under a…

We study derivative-free methods for policy optimization over the class of linear policies. We focus on characterizing the convergence rate of these methods when applied to linear-quadratic systems, and study various settings of driving…

Let $G$ be a finite group. The small Davenport constant $\mathsf d(G)$ of $G$ is the maximal integer $\ell$ such that there is a sequence of length $\ell$ over $G$ which has no nonempty product-one subsequence. In 2007, Bass conjectured…

We give an improved estimate for the density of $k$-free values of integral binary forms with no fixed $k$-th power divisor. Further, we give the corresponding improvement to a theorem of Stewart and Top on the number of power-free values…

We study the long-time behaviour of the temperature-driven compressible flows. We show that numerical solutions of a structure-preserving finite volume method generate a discrete attractor that consists of entire discrete trajectories.…

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

Decidability and synthesis of inductive invariants ranging in a given domain play an important role in many software and hardware verification systems. We consider here inductive invariants belonging to an abstract domain $A$ as defined in…

We extend Robins' theory of causal inference for complex longitudinal data to the case of continuously varying as opposed to discrete covariates and treatments. In particular we establish versions of the key results of the discrete theory:…

Here we study the long time behavior of an advection-diffusion equation with a general time varying (including random) shear flow imposing no-flux boundary conditions on channel walls. We derive the asymptotic approximation of the scalar…

We prove a new generalization of Davenport's Fourier expansion of the infinite series involving the fractional part function over arithmetic functions. A new Mellin transform related to the Riemann zeta function is also established.

We establish effective versions of Oppenheim's conjecture for generic inhomogeneous quadratic forms. We prove such results for fixed shift vectors and generic quadratic forms. When the shift is rational we prove a counting result which…

In this paper, we obtain some factorization results on formal power series over principle ideal domains with sharp bounds on number of irreducible factors. These factorization results correspondingly lead to irreducibility criteria for…

Let $G$ be a finite abelian group. We show that its Davenport constant $D(G)$ satisfies $D(G)\leq \exp(G)+\frac{|G|}{\exp(G)}-1$, provided that $\exp(G)\geq\sqrt{|G|}$, and $D(G)\leq 2\sqrt{|G|}-1$, if $\exp(G)<\sqrt{|G|}$. This proves a…

Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the emptiness problem for zero automata. We introduce a variant…

We present in this paper a new method to deal with automatic sequences. This method allows us to prove a M\"obius-randomness-principle for automatic sequences from which we deduce the Sarnak conjecture for this class of sequences.…

We study the advection equation along vector fields singular at the initial time. More precisely, we prove that for divergence-free vector fields in $L^1_{loc}((0, T ]; BV (\mathbb{T}^d;\mathbb{R}^d))\cap L^2((0, T )…

We prove several results about the relations between injectivity and surjectivity for sand automata. Moreover, we begin the exploration of the dynamical behavior of sand automata proving that the property of nilpotency is undecidable. We…

A relevant result independently obtained by Rayleigh and Sneddon on an identity on series involving the zeros of Bessel functions of the first kind is derived by an alternative method based on Laplace transforms. Our method leads to a…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…