English
Related papers

Related papers: Integers representable as differences of linear re…

200 papers

We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…

Combinatorics · Mathematics 2022-05-18 Catherine Greenhill , Mikhail Isaev , Tamás Makai , Brendan D. McKay

Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…

Combinatorics · Mathematics 2007-05-23 E. Rodney Canfield , Catherine Greenhill , Brendan D. McKay

We give formulas for the number of representations of non negative integers by various quadratic forms. We also give evaluations in the case of sum of two cubes (cubic case) and the quintic case, as well. We introduce a class of generalized…

General Mathematics · Mathematics 2015-04-30 Nikos Bagis , M. L Glasser

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

Symbolic Computation · Computer Science 2013-06-19 Marc Mezzarobba , Bruno Salvy

We discuss the problem of counting {\em incidence matrices}, i.e. zero-one matrices with no zero rows or columns. Using different approaches we give three different proofs for the leading asymptotics for the number of matrices with $n$ ones…

Combinatorics · Mathematics 2009-11-11 Peter Cameron , Thomas Prellberg , Dudley Stark

Suppose l=2m+1, m>0. We introduce m "theta-series", [1],...,[m], in Z/2[[x]]. It has been conjectured that the n for which the coefficient of x^n in 1/[i] is 1 form a set of density 0. This is probably always false, but in certain cases,…

Number Theory · Mathematics 2011-07-22 Paul Monsky

For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for…

Number Theory · Mathematics 2009-08-27 Chris Smyth

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

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…

Combinatorics · Mathematics 2022-11-07 Nathan Fox

Professor Tibor \v{S}al\'at, at one of his seminars at Comenius University, Bratislava, asked to study the influence of gaps of an integer sequence A={a_1<a_2<...<a_n<...} on its exponent of convergence. The exponent of convergence of A…

Number Theory · Mathematics 2012-01-11 Georges Grekos , Jana Tomanová , Martin Sleziak

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…

Number Theory · Mathematics 2007-05-23 Jeffrey Lin Thunder

Several measures for the density of sets of integers have been proposed, such as the asymptotic density, the Schnirelmann density, and the Dirichlet density. There has been some work in the literature on extending some of these concepts of…

Number Theory · Mathematics 2019-08-15 L. C. Rêgo , R. J. Cintra

Let $F$ and $G$ be linear recurrences over a number field $\mathbb{K}$, and let $\mathfrak{R}$ be a finitely generated subring of $\mathbb{K}$. Furthermore, let $\mathcal{N}$ be the set of positive integers $n$ such that $G(n) \neq 0$ and…

Number Theory · Mathematics 2017-08-29 Carlo Sanna

We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…

Combinatorics · Mathematics 2024-12-20 David Bevan , Dan Threlfall

Let $\mathcal{P}$ be the set of primes and $\mathbb{N}$ the set of positive integers. Let also $r_1,...,r_t$ be positive real numbers and $R_2(r_1,...,r_t)$ the set of odd integers which can be represented as $$ p+2^{\lfloor…

Number Theory · Mathematics 2024-12-17 Yuchen Ding , Wenguang Zhai

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

Number Theory · Mathematics 2021-06-04 Alessandro Languasco , Alessandro Zaccagnini

Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…

Information Theory · Computer Science 2012-12-27 Yun Fan , San Ling , Hongwei Liu , Jing Shen , Chaoping Xing

Let $\mathfrak g$ be a reductive Lie algebra, and $m$ a positive integer. There is a natural density of irreducible representations of $\mathfrak g$, whose degrees are not divisible by $m$. For $\mathfrak g=\mathfrak{gl}_n$, this density…

Representation Theory · Mathematics 2023-12-04 Varun Shah , Steven Spallone

Let $r_{k}(n)$ denote the number of representations of the integer $n$ as a sum of $k$ squares. In this paper, we give an asymptotic for $r_{k}(n)$ when $n$ grows linearly with $k$. As a special case, we find that \[ r_{n}(n) \sim \frac{B…

Number Theory · Mathematics 2023-12-20 John Holley-Reid , Jeremy Rouse