English
Related papers

Related papers: Almost p-ary Sequences

200 papers

The STAR Collaboration reports measurements of back-to-back azimuthal correlations of di-$\pi^0$ produced at forward pseudorapidity ($2.6<\eta<4.0$) in $p+$$p$, $p+$$\mathrm{Al}$ and $p+$$\mathrm{Au}$ collisions at a center-of-mass energy…

Nuclear Experiment · Physics 2021-10-11 Xiaoxuan Chu

In this paper we consider the fractional parts of a general sequence, for example the sequence $\alpha \sqrt{n}$ or $\alpha n^2$. We give a general method, which allows one to show that long-range correlations (correlations where the…

Dynamical Systems · Mathematics 2020-07-21 Christopher Lutsko

We study a one-dimensional quasiperiodic system described by the Aubry-Andr\'e model in the small wave vector limit and demonstrate the existence of almost mobility edges and critical regions in the system. It is well known that the…

Disordered Systems and Neural Networks · Physics 2018-01-03 Yucheng Wang , Gao Xianlong , Shu Chen

C. Thomassen (Proc. London Math. Soc. (3) 42 (1981), 231-251) gave a characterization of strongly connected non-Hamiltonian digraphs of order $p\geq 3$ with minimum degree $p-1$. In this paper we give an analogous characterization of…

Combinatorics · Mathematics 2019-11-15 Samvel Kh. Darbinyan

Gevrey 2 quasi-periodic cocycles with diophantine frequency, close to a constant, with values in classical Lie groups, are almost reducible in a weak sense. This is the analogue of Eliasson's almost reducibility theorem for analytic…

Dynamical Systems · Mathematics 2010-01-13 Claire Chavaudret

Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes for radius $t=1$ or dimension $n=1, 2$. It is admitted that the existence and the construction of quasi-perfect Lee codes have to be studied since they are the…

Information Theory · Computer Science 2016-08-25 Sihem Mesnager , Chunming Tang , Yanfeng Qi

Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the…

Combinatorics · Mathematics 2013-10-16 Kathleen Nowak , Oktay Olmez , Sung Y. Song

We introduce a new probabilistic technique for finding 'almost-periods' of convolutions of subsets of groups. This gives results similar to the Bogolyubov-type estimates established by Fourier analysis on abelian groups but without the need…

Number Theory · Mathematics 2010-09-15 Ernie Croot , Olof Sisask

As a result of a rather long-time research started in 2016, this theory whose structure is based on a fixed variable and an algebraic inequality, improves and somehow generalizes the well-known least squares theory. In fact, the fixed…

Statistics Theory · Mathematics 2023-10-24 Mohammad Masjed-Jamei

In this paper, we follow the recent work of Helleseth, Kholosha, Johanssen and Ness to study the cross correlation between an $m$-sequence of period $2^m-1$ and the $d$-decimation of an $m$-sequence of shorter period $2^{n}-1$ for an even…

Information Theory · Computer Science 2008-01-08 Lei Hu , Xiangyong Zeng , Nian Li , Wenfeng Jiang

We prove that analogues of the Hardy-Littlewood generalised twin prime conjecture for almost primes hold on average. Our main theorem establishes an asymptotic formula for the number of integers $n=p_1p_2 \leq X$ such that $n+h$ is a…

Number Theory · Mathematics 2022-06-20 Natalie Evans

A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

We consider the Bernoulli bond percolation process $\mathbb{P}_{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which…

Probability · Mathematics 2015-01-13 S. Friedli , D. Ioffe , Y. Velenik

Bounds for $\max\{m,\tilde{m}\}$ subject to $m,\tilde{m} \in \mathbb{Z}\cap[1,p)$, $p$ prime, $z$ indivisible by $p$, $m\tilde{m}\equiv z\bmod p$ and $m$ belonging to some fixed Beatty sequence $\{ \lfloor n\alpha+\beta \rfloor :…

Number Theory · Mathematics 2023-06-05 Marc Technau

Let $\mathcal{F}$ and $\mathcal{G}$ be two $t$-uniform families of subsets over $[k] = \{1,2,...,k\}$, where $|\mathcal{F}| = |\mathcal{G}|$, and let $C$ be the adjacency matrix of the bipartite graph whose vertices are the subsets in…

Combinatorics · Mathematics 2020-05-19 Michal Parnas

We study the $c$-approximate near neighbor problem under the continuous Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the curves into a…

Computational Geometry · Computer Science 2021-11-05 Karl Bringmann , Anne Driemel , André Nusser , Ioannis Psarros

We investigate the superconducting phase diagram and boundary modes for a quasi-1D system formed by three Fe-Chains on an s-wave superconductor, motivated by the recent Princeton experiment. The $\vec l\cdot\vec s$ onsite spin-orbit term,…

Strongly Correlated Electrons · Physics 2016-09-26 Yu-Qin Chen , Yi-Ming Wu , Xiong-Jun Liu

The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error…

Computational Complexity · Computer Science 2016-10-11 Jérôme Javelle , Mehdi Mhalla , Simon Perdrix

In this article we study orbits of proximal pairs in almost automorphic subshifts. The corresponding orbits in the maximal equicontinuous factor are precisely those orbits that intersect the boundary of the subshift's separating cover. We…

Dynamical Systems · Mathematics 2025-09-04 Daniel Sell , Franziska Sieron

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

Combinatorics · Mathematics 2014-09-09 Jiangtao Peng , Fang Sun