English
Related papers

Related papers: On a Balanced Property of Compositions

200 papers

We reprove twice, in a simpler but as elementary way, a result by Hor\'ak and Skula (1985) who determined, among all sequences of integers defined by $$u_1=1,\quad u_2=R,\quad u_{n+2}=Pu_{n+1}-Qu_n$$ for some integers $P,Q,R$, those which…

Number Theory · Mathematics 2017-06-20 A. Bauval

For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…

Number Theory · Mathematics 2025-07-08 Marcus Nilsson

In a recent paper, Bary-Soroker, Koukoulopoulos and Kozma proved that when $A$ is a random monic polynomial of $\mathbb{Z}[X]$ of deterministic degree $n$ with coefficients $a_j$ drawn independently according to measures $\mu_j,$ then $A$…

Number Theory · Mathematics 2025-07-16 Pierre-Alexandre Bazin

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

Number Theory · Mathematics 2016-02-08 Tigran Hakobyan

Composite likelihood has shown promise in settings where the number of parameters $p$ is large due to its ability to break down complex models into simpler components, thus enabling inference even when the full likelihood is not tractable.…

Methodology · Statistics 2021-07-21 Claudia Di Caterina , Davide Ferrari

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

Probability · Mathematics 2007-05-23 Dimitris Achlioptas , Assaf Naor , Yuval Peres

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

Number Theory · Mathematics 2025-10-20 Harry Altman , Juan Arias de Reyna

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…

Combinatorics · Mathematics 2017-11-09 Lisa Hui Sun , Mingzhi Zhang

Let $G$ be an almost simple group with socle $A_n$, the alternating group of degree $n$. We prove that there is a unit of order $pq$ in the integral group ring of $G$ if and only if there is an element of that order in $G$ provided $p$ and…

Group Theory · Mathematics 2017-06-27 Andreas Bächle , Mauricio Caicedo

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} \sum\limits_{i+j+k=p^{r}\atop{i,j,k\in \mathcal{P}_{p}}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} (\bmod p^{r}),…

Number Theory · Mathematics 2015-03-12 Zhongyan Shen , Tianxin Cai

We give an integrability criterion on a real-valued non-increasing function $\psi$ guaranteeing that for almost all (or almost no) pairs $(A, \textbf{b})$, where $A$ is a real $m\times n$ matrix and $\textbf{b} \in \mathbb{R}^m$, the system…

Number Theory · Mathematics 2019-06-26 Dmitry Kleinbock , Nick Wadleigh

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

Formal Languages and Automata Theory · Computer Science 2009-07-06 M. Rigo , L. Waxweiler

Let $p \in (0, \infty)$ be a constant and let $\{\xi_n\} \subset L^p(\Omega, {\mathcal F}, \P)$ be a sequence of random variables. For any integers $m, n \ge 0$, denote $S_{m, n} = \sum_{k=m}^{m + n} \xi_k$. It is proved that, if there…

Probability · Mathematics 2010-12-21 Erkan Nane , Yimin Xiao , Aklilu Zeleke

\textit{Matching families} are one of the major ingredients in the construction of {\em locally decodable codes} (LDCs) and the best known constructions of LDCs with a constant number of queries are based on matching families. The…

Information Theory · Computer Science 2013-04-01 Yeow Meng Chee , San Ling , Huaxiong Wang , Liang Feng Zhang

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

Combinatorics · Mathematics 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof

The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…

Group Theory · Mathematics 2025-07-30 Martino Garonzi , Christe Montijo , Alexandre Zalesski

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…

Combinatorics · Mathematics 2016-08-18 S. P. Glasby

Let $p$ be a nonconstant form in $\mathbb{R}[x_1,\dots,x_n]$ with $p(1,\dots,1)>0$. If $p^m$ has strictly positive coefficients for some integer $m\ge1$, we show that $p^m$ has strictly positive coefficients for all sufficiently large $m$.…

Algebraic Geometry · Mathematics 2017-04-11 Claus Scheiderer , Colin Tan

Given a compact subset $\Sigma$ of the real numbers obeying some technical conditions, we consider the set of algebraic integers whose conjugates all lie in $\Sigma$. The distribution of conjugates of such an integer defines a probability…

Number Theory · Mathematics 2024-03-19 Alexander Smith

We show that given a positive integer $m$, a real number $p\in\left[ 2,\infty\right)$ and $1\leq s<p^{\ast}$ the set of non--multiple $\left( r;s\right)$--summing $m$--linear forms on $\ell_{p}\times\cdots\times \ell_{p}$ contains, except…

Functional Analysis · Mathematics 2015-09-08 Gustavo Araujo , Daniel Pellegrino