English
Related papers

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

200 papers

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

Logic in Computer Science · Computer Science 2022-01-03 Abhisekh Sankaran

In the spirit of the famous KOML\'OS (1967) theorem, every sequence of nonnegative, measurable functions $\{ f_n \}_{n \in \N}$ on a probability space, contains a subsequence which - along with all its subsequences - converges a.e. in…

Probability · Mathematics 2022-04-11 Ioannis Karatzas , Walter Schachermayer

Let $F$ be an integral linear recurrence, $G$ be an integer-valued polynomial splitting over the rationals, and $h$ be a positive integer. Also, let $\mathcal{A}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd(F(n), G(n)) =…

Number Theory · Mathematics 2020-12-15 Daniele Mastrostefano , Carlo Sanna

We study commutative algebra arising from generalised Frobenius numbers. The $k$-th (generalised) Frobenius number of natural numbers $(a_1,\dots,a_n)$ is the largest natural number that cannot be written as a non-negative integral…

Commutative Algebra · Mathematics 2018-07-17 Madhusudan Manjunath , Ben Smith

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

Number Theory · Mathematics 2025-01-08 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

A problem by Feichtinger, Heil, and Larson asks whether every infinite matrix $A$ with $\sum_{k,l}|A_{kl}| < \infty$ (an equivalent substitute for the Feichtinger algebra) that is positive-semidefinite admits a symmetric rank-one…

Functional Analysis · Mathematics 2026-05-11 Radu Balan , Fushuai Jiang

In this paper we provide two results. The first one consists an infinitary version of the Furstenberg-Weiss Theorem. More precisely we show that every subset $A$ of a homogeneous tree $T$ such that $\frac{|A\cap T(n)|}{|T(n)|}\geq\delta$,…

Combinatorics · Mathematics 2015-09-30 Konstantinos Tyros

In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…

Number Theory · Mathematics 2024-03-22 Florian Luca , Tom Ward

For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. The it is well known that only finitely many positive integers…

Number Theory · Mathematics 2024-11-08 Santak Panda , Kartikeya Rai , Amitabha Tripathi

Let $F_{n}$ and $L_n$ be the $n$th Fibonacci and Lucas number, respectively. For each positive integer $m$, the order of appearance of $m$ in the Fibonacci sequence, denoted by $z(m)$, is the smallest positive integer $k$ such that $m$…

Number Theory · Mathematics 2017-08-01 Narissara Khaochim , Prapanpong Pongsriiam

We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…

Combinatorics · Mathematics 2007-05-23 Jason P. Bell , Stefan Gerhold

A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…

History and Overview · Mathematics 2007-05-23 Wai Yan Pong

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

Number Theory · Mathematics 2023-08-29 Kalman Gyory , Attila Petho , Laszlo Szalay

We consider formal power series $f(z) = \omega z + a_2z^2 + \ldots \ (\omega \neq 0)$, with coefficients in a field of characteristic $0$. These form a group under the operation of composition (= substitution). We prove (Theorem 1) that…

Combinatorics · Mathematics 2018-06-04 Marshall M. Cohen

We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

Dynamical Systems · Mathematics 2017-01-24 Nikita Moriakov

Fourier-Dedekind sums are a generalization of Dedekind sums - important number-theoretical objects that arise in many areas of mathematics, including lattice point enumeration, signature defects of manifolds and pseudo random number…

Number Theory · Mathematics 2013-10-07 Emmanuel Tsukerman

We show a necessary and sufficient condition on the existence of finite order entire solutions of linear differential equations $$ f^{(n)}+a_{n-1}f^{(n-1)}+\cdots+a_1f'+a_0f=0,\eqno(+) $$ where $a_i$ are exponential sums for…

Complex Variables · Mathematics 2024-12-23 Xing-Yu Li , Jun Wang , Zhi-Tao Wen

We extend Balser-Kostov method of studying summability properties of a singularly perturbed inhomogeneous linear system with regular singularity at origin to nonlinear systems of the form \varepsilon zf^{\prime} = F(\varepsilon,z,f) with F…

Complex Variables · Mathematics 2012-07-19 William R. P. Conti , Domingos H. U. Marchetti

We consider Aichinger's equation $$f(x_1+\cdots+x_{m+1})=\sum_{i=1}^{m+1}g_i(x_1,x_2,\cdots, \widehat{x_i},\cdots, x_{m+1})$$ for functions defined on commutative semigroups which take values on commutative groups. The solutions of this…

Commutative Algebra · Mathematics 2022-12-13 J. M. Almira

Using the notion of the composita, we obtain a method of solving iterative functional equations of the form $A^{2^n}(x)=F(x)$, where $F(x)=\sum_{n>0} f(n)x^n$, $f(1)\neq 0$. We prove that if $F(x)=\sum_{n>0} f(n)x^n$ has integer…

Combinatorics · Mathematics 2013-02-12 Dmitry Kruchinin , Vladimir Kruchinin
‹ Prev 1 3 4 5 6 7 10 Next ›