English
Related papers

Related papers: Higher Order Log-Concavity in Euler's Difference T…

200 papers

Let $n \ge 5$ and $k\ge 4$ be positive integers. We determine the maximum size of digraphs of order n that avoid distinct walks of length k with the same endpoints. We also characterize the extremal digraphs attaining this maximum number…

Combinatorics · Mathematics 2016-08-23 Zejun Huang , Zhenhua Lyu , Pu Qiao

The relative log-concavity ordering $\leq_{\mathrm{lc}}$ between probability mass functions (pmf's) on non-negative integers is studied. Given three pmf's $f,g,h$ that satisfy $f\leq_{\mathrm{lc}}g\leq_{\mathrm{lc}}h$, we present a pair of…

Statistics Theory · Mathematics 2010-10-12 Yaming Yu

The generalized hyperharmonic numbers $h_n^{(m)}(k)$ are defined by means of the multiple harmonic numbers. We show that the hyperharmonic numbers $h_n^{(m)}(k)$ satisfy certain recurrence relation which allow us to write them in terms of…

Number Theory · Mathematics 2018-01-22 Ce Xu

The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists of reversing the direction of all arcs of $D\langle X\rangle$. We study $sinv'_k(D)$ (resp. $sinv_k(D)$) which is the minimum number of inversions needed to transform…

Combinatorics · Mathematics 2025-12-12 Julien Duron , Frédéric Havet , Florian Hörsch , Clément Rambaud

We study the Unadjusted Langevin Algorithm (ULA) for sampling from a probability distribution $\nu = e^{-f}$ on $\mathbb{R}^n$. We prove a convergence guarantee in Kullback-Leibler (KL) divergence assuming $\nu$ satisfies a log-Sobolev…

Data Structures and Algorithms · Computer Science 2022-03-04 Santosh S. Vempala , Andre Wibisono

We prove a lower bound of exp(-C (log(2/alpha))^7)N^{k-1} to the number of solutions of an invariant equation in k variables, contained in a set of density alpha. Moreover, we give a Behrend-type construction for the same problem with the…

Number Theory · Mathematics 2023-06-16 Tomasz Kosciuszko

Given a recurrent sequence ${\bf U}:=\{U_n\}_{n\ge 0}$ we consider the problem of counting ${\mathcal M}_U(x)$, the number of integers $n\le x$ such that $U_n=u^2+nv^2$ for some integers $u,v$. We will show that ${\mathcal M}_U(x)\ll x(\log…

Number Theory · Mathematics 2020-08-27 Emil-Alexandru Ciolan , Florian Luca , Pieter Moree

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 develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…

Combinatorics · Mathematics 2012-03-13 Balazs Szegedy

Let $k$ and $n$ be natural numbers. Let $\omega_k(n)$ denote the number of distinct prime factors of $n$ with multiplicity $k$ as studied by Elma and the third author. We obtain asymptotic estimates for the first and the second moments of…

Number Theory · Mathematics 2024-09-18 Sourabhashis Das , Wentang Kuo , Yu-Ru Liu

Take any $d + 3$ points in $\mathbb{R}^d$. It is known that (a) if $d = 2k + 1$, then there are two linked $(k + 1)$-simplices with the vertices at these points; (b) if $d = 2k$, then there are two disjoint $(k + 1)$-tuples of these points…

Combinatorics · Mathematics 2024-02-15 M. Starkov

We obtain global explicit numerical bounds, with best possible constants, for the differences $\frac{1}{n}\sum_{k\leq n}\omega(k)-\log\log n$ and$ \frac{1}{n}\sum_{k\leq n}\Omega(k)-\log\log n$, where $\omega(k)$ and $\Omega(k)$ refer to…

Number Theory · Mathematics 2023-05-16 Mehdi Hassani

We prove that if $N$ points lie in convex position in the plane then they determine $\Omega(N^{5/4})$ distinct angles, provided that the points do not lie on a common circle. This is derived from a more general claim that if $N$ points in…

Combinatorics · Mathematics 2025-10-14 Sergei V. Konyagin , Jonathan Passant , Misha Rudnev

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

Combinatorics · Mathematics 2016-07-26 Jordan Almeter , Samet Demircan , Andrew Kallmeyer , Kevin G. Milans , Robert Winslow

A triangle $\{a(n,k)\}_{0\le k\le n}$ of nonnegative numbers is LC-positive if for each $r$, the sequence of polynomials $\sum_{k=r}^{n}a(n,k)q^k$ is $q$-log-concave. It is double LC-positive if both triangles $\{a(n,k)\}$ and…

Combinatorics · Mathematics 2007-05-23 Yi Wang , Yeong-Nan Yeh

For a finite abelian group $G$ and a positive integer $k$, let $\mathsf{D}_k(G)$ denote the smallest integer $\ell$ such that each sequence over $G$ of length at least $\ell$ has $k$ disjoint nontrivial zero-sum subsequences. It is known…

Combinatorics · Mathematics 2025-03-28 Qinghai Zhong

It is well known that \textit{every} Eulerian orientation of an Eulerian $2k$-edge connected (undirected) graph is strongly $k$-edge connected. An important goal in the area is to obtain analogous results for other types of connectivity,…

Combinatorics · Mathematics 2018-10-19 Maxwell Levit , L. Sunil Chandran , Joseph Cheriyan

We study the Euler scheme for a stochastic differential equation driven by a Levy process Y. More precisely, we look at the asymptotic behavior of the normalized error process u_n(X^n-X), where X is the true solution and X^n is its Euler…

Probability · Mathematics 2007-05-23 Jean Jacod

A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the positive divisors of $n$. In this paper, we establish the structure theorem of odd multiperfect…

Number Theory · Mathematics 2011-02-23 Shi-Chao Chen , Hao Luo

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

Combinatorics · Mathematics 2023-11-17 Adrian Beker
‹ Prev 1 3 4 5 6 7 10 Next ›