English
Related papers

Related papers: Generalizing Zeckendorf's Theorem to f-decompositi…

200 papers

Let $r_1,\ldots,r_s:\mathbb{Z}_{n\geqslant 0}\to\mathbb{C}$ be linearly recurrent sequences whose associated eigenvalues have arguments in $\pi\mathbb{Q}$ and let $F(z):=\sum_{n\geqslant 0}f(n)z^n$, where $f(n)\in\{r_1(n),\ldots,$…

Number Theory · Mathematics 2017-09-05 Michael Coons

Let $f(x)=\sum_{n=0}^{\infty}\frac{1}{n!}q^{n(n-1)/2}x^n$ ($0<q<1$) be the deformed exponential function. It is known that the zeros of $f(x)$ are real and form a negative decreasing sequence $(x_k)$ ($k\ge 1$). We investigate the complete…

Classical Analysis and ODEs · Mathematics 2017-09-14 Liuquan Wang , Cheng Zhang

For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for…

Dynamical Systems · Mathematics 2007-05-23 N. Frantzikinakis , E. Lesigne , M. Wierdl

We prove general equidistribution statements (both conditional and unconditional) relating to the Fourier coefficients of arithmetically normalized holomorphic Hecke cusp forms $f_1,\ldots,f_k$ without complex multiplication, of equal…

Number Theory · Mathematics 2020-09-08 Oleksiy Klurman , Alexander Mangerel

Let $m,s,t$ are positive integers with $t\leq s-2$ and $a_1,a_2,\ldots,a_s$ are positive integers such that $(a_1,a_2,\ldots,a_{s-1})=1$. In the paper we prove that every sufficiently large positive integer can be written in the form…

Number Theory · Mathematics 2022-09-27 Piotr Miska , Maciej Zakarczemny

The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…

Number Theory · Mathematics 2007-12-31 Peter Hegarty

In these notes we study the $k$-generalized Fibonacci sequences - $(F_n^{(k)})_{n\in \Z}$ - with positive and negative indices. Denote $T_k(x)$ its characteristic polynomial. Our most interesting finding is that if $k$ is even then the…

Number Theory · Mathematics 2020-08-26 Attila Pethő

The uniformity of the decomposition law, for a family F of Lie algebras which includes the exceptional Lie algebras, of the tensor powers ad^n of their adjoint representations ad is now well-known. This paper uses it to embark on the…

Mathematical Physics · Physics 2011-09-01 A. J. Macfarlane , Hendryk Pfeiffer

Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…

Rings and Algebras · Mathematics 2024-06-10 João Dias , Bruno Dinis

The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms $F(n,k)$ is extended to certain nonhypergeometric terms. An expression $F(n,k)$ is called a hypergeometric term if both…

Classical Analysis and ODEs · Mathematics 2016-09-06 Wolfram Koepf

To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…

Functional Analysis · Mathematics 2024-07-02 Alain Thomas

If an irreducible fraction $\frac mn>0$ can be decomposed into the sum of several irreducible proper fractions with different denominators, and the positive number smaller than $\frac mn$ in fractional ideal $\frac 1n\mathbb Z$ can not be…

Number Theory · Mathematics 2025-02-27 Sunben Chiu , Pingzhi Yuan , Hongjian Li

The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…

Number Theory · Mathematics 2022-06-10 F. Javier de Vega

In this paper we study the Feichtinger Conjecture in frame theory, which was recently shown to be equivalent to the 1959 Kadison-Singer Problem in $C^{*}$-Algebras. We will show that every bounded Bessel sequence can be decomposed into two…

Functional Analysis · Mathematics 2007-05-23 Peter G. Casazza , Gitta Kutyniok , Darrin Speegle , Janet C. Tremain

Let $ (G_n)_{n=0}^{\infty} $ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation $ G_n = f_1\alpha_1^n + \cdots + f_k\alpha_k^n $ and polynomial characteristic roots $…

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

Let $K$ be a field of characteristic zero and suppose that $f:\mathbb{N}\to K$ satisfies a recurrence of the form $$f(n)\ =\ \sum_{i=1}^d P_i(n) f(n-i),$$ for $n$ sufficiently large, where $P_1(z),...,P_d(z)$ are polynomials in $K[z]$.…

Number Theory · Mathematics 2015-05-28 Jason P. Bell , Stanley N. Burris , Karen Yeats

This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…

Number Theory · Mathematics 2022-04-22 Bakir Farhi

Let $G$ be a multiplicative subsemigroup of the general linear group $\Gl(\mathbb{R}^d)$ which consists of matrices with positive entries such that every column and every row contains a strictly positive element. Given a $G$--valued random…

Probability · Mathematics 2011-11-09 Mariusz Mirek

Let $A=A_1\oplus\cdots\oplus A_r$ be a decomposition of the algebra $A$ as a direct sum of vector subspaces. If for every choice of the indices $1\le i_j\le r$ there exist $a_{i_j}\in A_{i_j}$ such that the product $a_{i_1}\cdots a_{i_n}\ne…

Rings and Algebras · Mathematics 2024-10-18 Lucio Centrone , Plamen Koshlukov , Kauê Pereira

Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defining computability on arbitrary domains, as well as for…

Formal Languages and Automata Theory · Computer Science 2015-01-21 Jörg Endrullis , Clemens Grabmayer , Dimitri Hendriks