Related papers: Linear recurrences and rational Lambert series

We consider a notion of rationalizability, where the rationalizing relation may depend on the set of feasible alternatives. More precisely, we say that a choice function is locally rationalizable if it is rationalized by a family of…

Given a finitely generated linear group $G$ over $\mathbb{Q}$, we construct a simple group $\Gamma$ that has the same finiteness properties as $G$ and admits $G$ as a quasi-retract. As an application, we construct a simple group of type…

We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…

In this paper, two new series for the logarithm of the $\Gamma$-function are presented and studied. Their polygamma analogs are also obtained and discussed. These series involve the Stirling numbers of the first kind and have the property…

Loop percolation, also known as the dense O(1) loop model, is a variant of critical bond percolation in the square lattice Z^2 whose graph structure consists of a disjoint union of cycles. We study its connectivity pattern, which is a…

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

In 2007, A.I.Aptekarev and his collaborators discovered a sequence of rational approximations to Euler's constant $\gamma$ defined by a linear recurrence. In this paper, we generalize this result and present an explicit construction of…

In this article, we prove a Reocurrence Theorem over function fields of curves over $\mathbf{C}(\! (t)\! )$ and over finite extensions of the Laurent series field $\mathbf{C}(\! (x,y)\! )$. This provides a partial replacement to…

On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

Let $k$ be an infinite field. The notion of retract $k$-rationality was introduced by Saltman in the study of Noether's problem and other rationality problems. We will investigate the retract rationality of a field in this paper. Theorem 1.…

We investigate the homogenization through Gamma-convergence for the L^2(\Omega)-weak topology of the conductivity functional with a zero-order term where the matrix-valued conductivity is assumed to be non strongly elliptic. Under proper…

Let $\Omega \subset \mathbb{R}$ be a compact set with measure $1$. If there exists a subset $\Lambda \subset \mathbb{R}$ such that the set of exponential functions $E_{\Lambda}:=\{e_\lambda(x) = e^{2\pi i \lambda x}|_\Omega :\lambda \in…

An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

Relative property (T) has recently been used to construct a variety of new rigidity phenomena, for example in von Neumann algebras and the study of orbit-equivalence relations. However, until recently there were few examples of group pairs…

A common assumption in modern microeconomic theory is that choice should be rationalizable via a binary preference relation, which \citeauthor{Sen71a} showed to be equivalent to two consistency conditions, namely $\alpha$ (contraction) and…

The classical Ulam sequence is defined recursively as follows: $a_1=1$, $a_2=2$, and $a_n$, for $n > 2$, is the smallest integer not already in the sequence that can be written uniquely as the sum of two distinct earlier terms. This…

Let $\Gamma$ be a countable group and $\mathrm{Sub}(\Gamma)$ its Chabauty space, namely the compact $\Gamma$-space consisting of all subgroups of $\Gamma$. We call a subgroup $\Delta \in \mathrm{Sub}(\Gamma)$ a boomerang subgroup if for…