English
Related papers

Related papers: Doppler Tolerance, Complementary Code Sets and the…

200 papers

The $[[7,1,3]]$ Steane code and $[[23,1,7]]$ quantum Golay code have been identified as good candidates for fault-tolerant quantum computing via code concatenation. These two codes have transversal implementations of all Clifford gates, but…

Quantum Physics · Physics 2024-04-22 Matthew Sullivan

Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we…

Number Theory · Mathematics 2014-09-30 Jakub Byszewski , Maciej Ulas

The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction…

Combinatorics · Mathematics 2019-02-04 Clément Dupont , Alex Fink , Luca Moci

The Thue--Morse sequence is a prototypical automatic sequence found in diverse areas of mathematics, and in computer science. We study occurrences of factors $w$ within this sequence, more precisely, the sequence of gaps between consecutive…

Combinatorics · Mathematics 2021-11-19 Lukas Spiegelhofer

Gowers norms have been a key component in the proofs of many breakthrough results in connection to the sum of digits function. Spiegelhofer has used them to show that the Thue-Morse sequence has level of distribution 1 and also that it is…

Number Theory · Mathematics 2025-10-21 Pascal Jelinek

Years ago Zeev Rudnick defined the ${\lambda}$-Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the initial segments follow the Poisson distribution with…

Number Theory · Mathematics 2024-02-29 Verónica Becher , Gabriel Sac Himelfarb

We present a general method for constructing radar transmit pulse trains and receive filters for which the radar point-spread function in delay and Doppler (radar cross-ambiguity function) is essentially free of range sidelobes inside a…

Information Theory · Computer Science 2020-01-28 Wenbing Dang , Ali Pezeshki , Stephen D. Howard , William Moran , Robert Calderbank

The modular forms are revisited from a geometric and an algebraic point of view leading to a geometric interpretation of the weak Maass forms connecting them to the Ramanujan Mock Theta functions and to the cusp forms generated from the…

General Mathematics · Mathematics 2012-05-16 Christian Pierre

Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of…

Group Theory · Mathematics 2017-12-19 E. A. O'Brien , Petr Vojtěchovský

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

Probability · Mathematics 2015-05-15 Shuyang Bai , Murad S. Taqqu

We develop a general algebraic framework involving "Poincar\'e--Novikov structures" and "filtered matched pairs" to provide an abstract approach to the barcodes associated to the homologies of interlevel sets of $\mathbb{R}$- or…

Algebraic Topology · Mathematics 2023-06-13 Michael Usher

In this note we first review the classical Petterson-Gorenstein-Zierler decoding algorithm for the class of alternant codes (which includes Reed-Solomon, Bose-Chaudhuri-Hocquenghem and classical Goppa codes), then we present an improvement…

Information Theory · Computer Science 2018-05-08 R. Farré , N. Sayols , S. Xambó-Descamps

We continue our study of one-loop integrals associated to BPS-saturated amplitudes in $\mathcal{N}=2$ heterotic vacua. We compute their large-volume behaviour, and express them as Fourier series in the complexified volume, with Fourier…

High Energy Physics - Theory · Physics 2018-01-22 Carlo Angelantonj , Ioannis Florakis , Boris Pioline

In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…

Number Theory · Mathematics 2023-05-22 Arne Winterhof

The first paper of this series introduced objects (elements of twisted relative cohomology) that are Poincar\'e dual to Feynman integrals. We show how to use the pairing between these spaces -- an algebraic invariant called the intersection…

High Energy Physics - Theory · Physics 2022-04-19 Simon Caron-Huot , Andrzej Pokraka

We construct "barcodes" for the chain complexes over Novikov rings that arise in Novikov's Morse theory for closed one-forms and in Floer theory on not-necessarily-monotone symplectic manifolds. In the case of classical Morse theory these…

Symplectic Geometry · Mathematics 2017-01-04 Michael Usher , Jun Zhang

We study the geometric change of Chow cohomology classes in projective toric varieties under the Weil-McMullen dual of the intersection product with a Lefschetz element. Based on this, we introduce toric chordality, a generalization of…

Combinatorics · Mathematics 2017-01-03 Karim Adiprasito

In this paper we define a new transform on (generalized) Boolean functions, which generalizes the Walsh-Hadamard, nega-Hadamard, $2^k$-Hadamard, consta-Hadamard and all $HN$-transforms. We describe the behavior of what we call the root-…

Information Theory · Computer Science 2019-07-23 Luis A. Medina , Matthew G. Parker , Constanza Riera , Pantelimon Stanica

We establish a Poincar\'e-Dulac theorem for sequences (G_n)_n of holomorphic contractions whose differentials d_0 G_n split regularly. The resonant relations determining the normal forms hold on the moduli of the exponential rates of…

Dynamical Systems · Mathematics 2008-02-08 F. Berteloot , C. Dupont , L. Molino

For studying topological obstructions to graph colorings, Hom-complexes were introduced by Lov\'{a}sz. A graph $T$ is called a test graph if for every graph $H$, the $k$-connectedness of $|Hom(T, H)|$ implies $\chi (H)\geq k + 1 + \chi(T)$.…

Combinatorics · Mathematics 2017-06-30 Hamid Reza Daneshpajouh