English
Related papers

Related papers: A density Chinese Remainder Theorem

200 papers

Recently, a multi-channel self-reset analog-to-digital converter (ADC) system with complex-valued moduli has been proposed. This system enables the recovery of high dynamic range complex-valued bandlimited signals at low sampling rates via…

Signal Processing · Electrical Eng. & Systems 2025-08-08 Xiaoping Li , Shiyang Sun , Qunying Liao , Xiang-Gen Xia

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let representation function $R_{A}(\overline{n})$ denote the number of…

Number Theory · Mathematics 2020-07-01 Cui-Fang Sun , Meng-Chi Xiong

Using a probabilistic model, based on random walks on the additive group $\mathbb{Z}/m\mathbb{Z}$, we prove that the values of certain real character sums are uniformly distributed in residue classes modulo $m$.

Number Theory · Mathematics 2011-04-27 Youness Lamzouri , Alexandru Zaharescu

The robust Chinese remainder theorem (CRT) has been recently proposed for robustly reconstructing a large nonnegative integer from erroneous remainders. It has found many applications in signal processing, including phase unwrapping and…

Information Theory · Computer Science 2020-10-28 Li Xiao , Xiang-Gen Xia , Yu-Ping Wang

A 2024 paper of Sun, Ding and Wang introduced a second class of constacyclic codes over finite fields, denoted $C(q,m,r,\ell)$, with length $(q^m-1)/r$, where $r\mid(q-1)$ and the defining monomials have total $q$-ary degree congruent to…

Information Theory · Computer Science 2026-05-29 Yaoran Yang , Yutong Zhang

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

Rings and Algebras · Mathematics 2015-12-29 Iuliana Ciocănea-Teodorescu

The Lonely Runner Conjecture of Wills and Cusick states that if $k+1$ runners start running at distinct constant speeds around a unit-length circular track, then for each runner there is a time when he/she is at least $1/(k+1)$ away from…

Combinatorics · Mathematics 2026-04-21 Tanupat Trakulthongchai

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Combinatorics · Mathematics 2025-09-29 Alexander Natalchenko , Arsenii Sagdeev

We characterize which residue classes contain infinitely many totients (values of Euler's function) and which do not. We show that the union of all residue classes that are totient-free has asymptotic density 3/4, that is, almost all…

Number Theory · Mathematics 2020-05-06 Kevin Ford , Sergei Konyagin , Carl Pomerance

We prove the density of the sets of the form ${{\lambda}_1^m {\mu}_1^n {\xi}_1 +...+{\lambda}_k^m {\mu}_k^n {\xi}_k : m,n \in \mathbb N}$ modulo one, where $\lambda_i$ and $\mu_i$ are multiplicatively independent algebraic numbers…

Dynamical Systems · Mathematics 2011-09-02 Alexander Gorodnik , Shirali Kadyrov

The Chinese remainder theorem (CRT) provides an efficient way to reconstruct an integer from its remainders modulo several integer moduli, and has been widely applied in signal processing and information theory. Its multidimensional…

Signal Processing · Electrical Eng. & Systems 2026-04-02 Guangpu Guo , Xiang-Gen Xia

The Lonely Runner Conjecture is a number theory problem, dating to 1964. Using dynamical systems theory, we show almost all sets of velocities solve the conjecture. Furthermore, any "traditional" approach of Diophantine approximation cannot…

Number Theory · Mathematics 2011-03-10 C. Harold Horvat , Matthew Stoffregen

Suppose that $k$ runners having different constant speeds run laps on a circular track of unit length. The Lonely Runner Conjecture states that, sooner or later, any given runner will be at distance at least $1/k$ from all the other…

Combinatorics · Mathematics 2012-02-07 Sebastian Czerwiński

Fix a set $D$ of positive integers. We study the maximum density $\mu(D)$ of sequences of integers in which the separation between any two terms does not fall in $D$. The $D$-sets considered in this article are of the form $\{1,j,k\}$. The…

Combinatorics · Mathematics 2017-12-22 Daphne Der-Fen Liu , Grant Robinson

It is well known and not difficult to prove that if $C$ of integers has positive upper Banach density, the set of differences $C-C$ is syndetic, i.e. the length of gaps is uniformly bounded. More surprisingly, Renling Jin showed that…

Combinatorics · Mathematics 2009-08-21 Mathias Beiglboeck

The lonely runner conjecture of Wills and Cusick asserts that if $n$ runners with distinct constant speeds run around a a circular unit length track, starting at a common time and place, then each runner will at some time be separated by a…

Combinatorics · Mathematics 2025-11-21 Benjamin Bedert

Let a be a positive integer which is not a perfect h-th power with h greater than 1, and Q_a(x;4,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo 4. When j=0, 2, it is known that…

Number Theory · Mathematics 2007-05-23 L. Murata , K. Chinen

We study leading singularities of scattering amplitudes which are obtained as residues of an integral over a Grassmannian manifold. We recursively do the transformation from twistors to momentum twistors and obtain an iterative formula for…

High Energy Physics - Theory · Physics 2015-05-20 Sujay K. Ashok , Eleonora Dell'Aquila

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

Combinatorics · Mathematics 2012-12-03 Henry Towsner

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

Number Theory · Mathematics 2025-05-30 Dohoon Choi , Youngmin Lee