English
Related papers

Related papers: Means of iterates

200 papers

We consider difference equations with several non-monotone deviating arguments and nonnegative coefficients. The deviations (delays and advances) are, generally, unbounded. Sufficient oscillation conditions are obtained in an explicit…

Dynamical Systems · Mathematics 2017-02-13 Elena Braverman , George E. Chatzarakis , Ioannis P. Stavroulakis

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…

Group Theory · Mathematics 2026-02-18 Weijia Wang , Rui Wang

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

Number Theory · Mathematics 2014-09-29 Matthew Tointon

We present bijections enumerating (k,m)-trees, k-gon trees, edge labelled (2,1)-trees, and other tree-like structures. Our constructions are based on Foata's (1971) bijection for cycle-free functions, which is simplified here.

Combinatorics · Mathematics 2007-05-23 Oleg Pikhurko

We focus on counting the number of labeled graphs on $n$ vertices and treewidth at most $k$ (or equivalently, the number of labeled partial $k$-trees), which we denote by $T_{n,k}$. So far, only the particular cases $T_{n,1}$ and $T_{n,2}$…

Combinatorics · Mathematics 2016-04-26 Julien Baste , Marc Noy , Ignasi Sau

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , J. Pintz , C. Y. Yildirim

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

Number Theory · Mathematics 2014-05-29 Kritkajohn Onphaeng , Prapanpong Pongsriiam

We introduce floating bodies for convex, not necessarily bounded subsets of $\mathbb{R}^n$. This allows us to define floating functions for convex and log concave functions and log concave measures. We establish the asymptotic behavior of…

Functional Analysis · Mathematics 2018-08-07 Ben Li , Carsten Schuett , Elisabeth M. Werner

We prove near-optimal upper bounds for the odd moments of the distribution of coprime residues in short intervals, confirming a conjecture of Montgomery and Vaughan. As an application we prove near-optimal upper bounds for the average of…

Number Theory · Mathematics 2026-05-13 Thomas F. Bloom , Vivian Kuperberg

We consider functions of the type $f(z)=z+a_2z^2+a_3z^3+\cdots$ from a family of all analytic and univalent functions in the unit disk. Let $F$ be the inverse function of $f$, given by $F(z)=w+\sum_{n=2}^{\infty}A_nw^n$ defined on some…

Complex Variables · Mathematics 2021-11-02 Vasudevarao Allu , Vibhuti Arora

A "practical number" is a positive integer $n$ such that every positive integer less than $n$ can be written as a sum of distinct divisors of $n$. We prove that most of the binomial coefficients are practical numbers. Precisely, letting…

Number Theory · Mathematics 2020-12-15 Paolo Leonetti , Carlo Sanna

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

Combinatorics · Mathematics 2007-05-23 Igor Rivin

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Number Theory · Mathematics 2012-04-10 Victor J. W. Guo , Jiang Zeng

We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…

Rings and Algebras · Mathematics 2022-11-28 Nicolas Doyon , Pierre-Olivier Parisé , William Verreault

By extending a construction due to Gross and McMullen [2], we show that for any odd integer n and for any even integer d>n+2 there are infinitely many Salem numbers $\alpha$ of degree d such that $\alpha^n-1$ is a unit. A similar result is…

Number Theory · Mathematics 2023-09-28 Toufik Zaimi

We estimate the average of any arithmetic function $k$ over the values of any smooth polynomial in many variables provided only that $k$ has a distribution in arithmetic progressions of fixed modulus. We give several applications of this…

Number Theory · Mathematics 2024-09-27 Kevin Destagnol , Efthymios Sofos

We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…

Dynamical Systems · Mathematics 2013-11-20 Giorgio Mantica

The characteristic functions of multivariate Feller processes with generator of affine type, and with smooth symbol functions have an explicit representation in terms of power series with rational number coefficients and with monmoms…

Functional Analysis · Mathematics 2010-02-17 Joerg Kampen

For a transcendental entire function f, we study the set of points BU(f) whose iterates under f neither escape to infinity nor are bounded. We give new results on the connectedness properties of this set and show that, if U is a Fatou…

Dynamical Systems · Mathematics 2016-10-03 J. W. Osborne , D. J. Sixsmith

Suppose $k\geqslant3$ is an integer. Let $\tau_k(n)$ be the number of ways $n$ can be written as a product of $k$ fixed factors. For any fixed integer $r\geqslant2$, we have the asymptotic formula \begin{equation*}…

Number Theory · Mathematics 2024-11-12 Zhen Guo , Xin Li