English
Related papers

Related papers: On Vu's theorem in Waring's problem for thinner se…

200 papers

The family of Shallit sequences consists of the Lucas sequences satisfying the recurrence $U_{n+2}(k)=(4k+2)U_{n+1}(k) -U_n(k),$ with initial values $U_0(k)=0$ and $U_1(k)=1$ and with $k\ge 1$ arbitrary. For every fixed $k$ the integers…

Number Theory · Mathematics 2023-09-25 Matteo Ferrari , Florian Luca , Pieter Moree

We prove some properties about the non-zero Taylor series coefficients $a_k$ of the Riemann xi function $\xi(s)$ at $s=\frac{1}{2}$. In particular, we present integral formulas that evaluate $a_k$ whose integrands involve a Gaussian…

Number Theory · Mathematics 2019-07-23 Mario DeFranco

Let $V$ be the set of $n\times n$ complex or real general matrices, Hermitian matrices, symmetric matrices, positive definite (resp. semi-definite) matrices, diagonal matrices, or upper triangular matrices. Fix $k\in \mathbb{Z}\setminus…

Functional Analysis · Mathematics 2022-01-25 Huajun Huang , Ming-Cheng Tsai

In this paper, we present an elementary proof of a theorem of Serre concerning the greatest eigenvalues of $k$-regular graphs. We also prove an analogue of Serre's theorem regarding the least eigenvalues of $k$-regular graphs: given…

Combinatorics · Mathematics 2007-05-23 Sebastian M. Cioaba

We prove that, for every decreasing sequence {a \sb k} of natural numbers, there exists a map f: X --> X with cat (f\sp k)=a\sb k.

Algebraic Topology · Mathematics 2007-05-23 Yuli B. Rudyak

In this paper, we will investigate the solvability of the equation $x_1^k + x_2^k + \ldots + x_s^k = n$, $n\in \mathbb{Z}_{p^k}$, $x_1,...,x_s\in \mathcal{A}$, $\mathcal{A}\subseteq \mathbb{Z}_{p^k}$. We will give a upper bound of the…

Combinatorics · Mathematics 2019-05-01 An-Ping Li

For positive integers $n\ge s> r$, the Tur\'an function $T(n,s,r)$ is the smallest size of an r-graph with n vertices such that every set of s vertices contains at least one edge. Also, define the Tur\'an density $t(s,r)$ as the limit of…

Combinatorics · Mathematics 2025-02-07 Oleg Pikhurko

For a fixed integer $k$, we define a sequence $A_k=(a_k(n))_{n\geq0}$ and a corresponding sparse subsequence $S_k$ using the cardinality of the $n$-th symmetric power of the set $\{1,2,\ldots, k\}$. For $k\in\{2,\dots,8\}$, we find…

Combinatorics · Mathematics 2024-07-23 Po-Yi Huang , Wen-Fong Ke

For integers $k,t \geq 2$ and $1\leq r \leq t$ let $D_k(r,t;n)$ be the number of parts among all $k$-regular partitions (i.e., partitions of $n$ where all parts have multiplicity less than $k$) of $n$ that are congruent to $r$ modulo $t$.…

Combinatorics · Mathematics 2022-07-12 Faye Jackson , Misheel Otgonbayar

The famous P\'{o}sa-Seymour conjecture, confirmed in 1998 by Koml\'{o}s, S\'{a}rk\"{o}zy, and Szemer\'{e}di, states that for any $k \geq 2$, every graph on $n$ vertices with minimum degree $kn/(k + 1)$ contains the $k$-th power of a…

Combinatorics · Mathematics 2018-08-31 Nemanja Škorić , Angelika Steger , Miloš Trujić

Consider the sequence $\mathcal{V}(2,n)$ constructed in a greedy fashion by setting $a_1 = 2$, $a_2 = n$ and defining $a_{m+1}$ as the smallest integer larger than $a_m$ that can be written as the sum of two (not necessarily distinct)…

Number Theory · Mathematics 2018-04-26 Borys Kuca

We present an extension of the Prouhet-Tarry-Escott problem by demonstrating that signed sums of noninteger powers of consecutive integers can be made arbitrarily close to zero.

History and Overview · Mathematics 2025-03-27 David Treeby , Edward Wang

For a rational number $r$ such that $1<r\leq 2$, an undirected $r$-power is a word of the form $xyx'$, where the word $x$ is nonempty, the word $x'$ is in $\{x,x^R\}$, and we have $|xyx'|/|xy|=r$. The undirected repetition threshold for $k$…

Combinatorics · Mathematics 2020-06-16 James D. Currie , Lucas Mol

Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer $n$ as a sum $n=\sum_k \epsilon_k U_k$, where the digits $\epsilon_k$ are taken from a finite alphabet $\Sigma$ and…

Number Theory · Mathematics 2011-03-02 Peter J. Grabner , Wolfgang Steiner

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

Let $t$ and $k$ be a positive integers, and let $I_k=\{i\in \mathbb{Z}:\; -k\leq i\leq k\}$. Let $\mathsf{s}'_t(I_k)$ be the smallest positive integer $\ell$ such that every zero-sum sequence $S$ over $I_k$ of length $|S|\ge \ell$ contains…

Combinatorics · Mathematics 2016-12-02 C. Augspurger , M. Minter , K. Shoukry , P. Sissokho , K. Voss

We determine a lower gap property for the growth of an unbounded \(\mathbb{Z}\)-valued \(k\)-regular sequence. In particular, if \(f:\mathbb{N}\to\mathbb{Z}\) is an unbounded \(k\)-regular sequence, we show that there is a constant \(c>0\)…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

It is shown that the sequence of rational numbers $r(k)$ generated by the ordinary generating function $\prod_{k=1}^\infty (1+x^k/k)$ converges to a limit $C > 0$. $C$ can be expressed as $C = \exp\Bigl(-\sum_{k = 2}^\infty…

Combinatorics · Mathematics 2019-04-17 Andreas B. G. Blobel

We prove that the sequence $(N_k)_k$, where each $N_k$ is defined as the smallest positive integer $n$ for which the $n$th term $g_{k,n}$ of the $k$-G\"obel sequence is not an integer, is unbounded.

Combinatorics · Mathematics 2025-02-26 Yuh Kobayashi , Shin-ichiro Seki

We consider certain Fibonacci-like sequences $(X_n)_{n\geq 0}$ perturbed with a random noise. Our main result is that $\frac{1}{X_n}\sum_{k=0}^{n-1}X_k$ converges in distribution, as $n$ goes to infinity, to a random variable $W$ with…

Probability · Mathematics 2017-09-18 Alexander Roitershtein , Zhirou Zhou
‹ Prev 1 3 4 5 6 7 10 Next ›