Related papers: Inductive Methods and zero-sum free sequences

We show that there is a positive constant $c_0$ such that \[\sum_{n\le x}\mu^2(n^2+1)c_0x+O_{\varepsilon}(x^{7/12+\varepsilon})\] for any fixed $\varepsilon>0$. This improves a result of Estermann [3] from 1931, in which the error term had…

Let $C_2$ be the cyclic group of order $2$ and $D_{2n}$ be the dihedral group of order $2n$, where $n$ is even. In this paper, we provide the exact values of some zero-sum constants over $D_{2n} \times C_2$, namely small Davenport constant,…

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…

We consider two families of weighted zero-sum constants for finite abelian groups. For a finite abelian group $( G , + )$, a set of weights $W \subset \mathbb{Z}$, and an integral parameter $m$, the $m$-wise Davenport constant with weights…

We generalize the notion of Davenport constants to a `higher degree' and obtain various lower and upper bounds, which are sometimes exact as is the case for certain finite commutative rings of prime power cardinality. Two simple examples…

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…

We deduce Levinson\'{}s theorem in non-relativistic quantum mechanics in one dimension as a sum rule for the spectral density constructed from asymptotic data. We assume a self-adjoint hamiltonian which guarantees completeness; the…

The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers. This is a fundamental reachability problem for continuous linear dynamical systems,…

$G$ be an additive finite abelian group. The Davenport constant $\mathsf D(G)$ is the smallest integer $t$ such that every sequence (multiset) $S$ over $G$ of length $|S|\ge t$ has a non-empty zero-sum subsequence. Recently, B. Girard…

Zero sum games with risk-sensitive cost criterion are considered with underlying dynamics being given by controlled stochastic differential equations. Under the assumption of geometric stability on the dynamics , we completely characterize…

For any $\varepsilon > 0$ we derive effective estimates for the size of a non-zero integral point $m \in \mathbb{Z}^d \setminus \{0\}$ solving the Diophantine inequality $\lvert Q[m] \rvert < \varepsilon$, where $Q[m] = q_1 m_1^2 + \ldots +…

Let $G$ be a finite group multiplicatively written. The small Davenport constant of $G$ is the maximum positive integer ${\sf d}(G)$ such that there exists a sequence $S$ of length ${\sf d}(G)$ for which every subsequence of $S$ is…

Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $D(G)$ such that every sequence of $G$ with $D(G)$ elements has a non-empty subsequence with product $1$. Let $D_{2n}$ be…

We prove the dynamic programming principe for uniformly nondegenerate stochastic differential games in the framework of time-homogeneous diffusion processes considered up to the first exit time from a domain. In contrast with previous…

We prove that for every integer $r \ge 1$ the Davenport constant $\mathsf{D}(C^r_n)$ is asymptotic to $rn$ when $n$ tends to infinity. An extension of this theorem is also provided.

We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular on some domain closed with respect to direct sums and similarity, the…

In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.

Let $G = C_{n_1} \oplus \cdots \oplus C_{n_r}$ with $1 < n_1 | \cdots | n_r$ be a finite abelian group. The Davenport constant $\mathsf D(G)$ is the smallest integer $t$ such that every sequence $S$ over $G$ of length $|S|\ge t$ has a…

Given an equidistributed set in the whole Euclidean space, we have established in [1] that there exists a constant positive $C$ such that the observability inequality of diffusion equations holds for all $T\in]0,1[$, with an observability…