English
Related papers

Related papers: On Finite Pseudorandom Binary Sequences: Functions…

200 papers

Let $(\mathcal{X},d,\mu)$ be a doubling metric measure space in the sense of R. R. Coifman and G. Weiss, $L$ a non-negative self-adjoint operator on $L^2(\mathcal{X})$ satisfying the Davies--Gaffney estimate, and $X(\mathcal{X})$ a ball…

Functional Analysis · Mathematics 2023-04-28 Xiaosheng Lin , Dachun Yang , Sibei Yang , Wen Yuan

A few years ago new quantitative measures of pseudorandomness of binary sequences have been introduced. Since that these measures have been studied in many papers and many constructions have been given along these lines. In this paper the…

Number Theory · Mathematics 2018-03-16 László Mérai , Joël Rivat , András Sárközy

We consider an equidistant array of disjoint potential wells in $\mathbb{R}^\nu,\: \nu\ge 2$, built over a straight line, and show that, under a restriction on the potential support aspect ratio, a perturbation consisting of longitudinal…

Spectral Theory · Mathematics 2025-08-05 Pavel Exner , David Spitzkopf

We extend the potential theory on almost minimzers from Part 1. We introduce so-called Hardy structures to study many classical operators using the tools from part 1. Furthermore, we show that for a naturally defined operator L, minimal…

Differential Geometry · Mathematics 2018-10-09 Joachim Lohkamp

In this paper, we characterize the average Hamming weight distribution of subsequences of maximum-length sequences ($m$-sequences). In particular, we consider all possible $m$-sequences of dimension $k$ and find the average number of…

Information Theory · Computer Science 2021-07-13 Mahyar Shirvanimoghaddam

We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…

Combinatorics · Mathematics 2011-04-29 Alexander Barg , Oleg R. Musin

Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain…

Information Theory · Computer Science 2024-05-14 Tuvi Etzion

We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…

Logic in Computer Science · Computer Science 2018-10-10 Karl Schlechta

In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2…

Number Theory · Mathematics 2020-02-28 Pierre-Adrien Tahay

Let $u(x)$ be a subpolynomial function in a Hardy field. We establish necessary and sufficient conditions for the weighted uniform distribution of the sequences $(u(n))_{n\in\mathbb{N}}$ and $(u(p_n))_{n\in\mathbb{N}}$, where $p_n$ denotes…

Number Theory · Mathematics 2025-09-25 Vitaly Bergelson , Grigori Kolesnik , Younghwan Son

We study closure properties for the Littlestone and threshold dimensions of binary hypothesis classes. Given classes $\mathcal{H}_1, \ldots, \mathcal{H}_k$ of Boolean functions with bounded Littlestone (respectively, threshold) dimension,…

Machine Learning · Computer Science 2020-07-08 Badih Ghazi , Noah Golowich , Ravi Kumar , Pasin Manurangsi

Context. In previous work, we developed a quasi-Gaussian approximation for the likelihood of correlation functions, which, in contrast to the usual Gaussian approach, incorporates fundamental mathematical constraints on correlation…

Cosmology and Nongalactic Astrophysics · Physics 2015-10-21 Philipp Wilking , Randolf Röseler , Peter Schneider

Learning models have been shown to rely on spurious correlations between non-predictive features and the associated labels in the training data, with negative implications on robustness, bias and fairness. In this work, we provide a…

Machine Learning · Statistics 2025-05-29 Simone Bombari , Marco Mondelli

Within the Correlated Gaussian Method the parameters of the Gaussian basis functions are often chosen stochastically using pseudo-random sequences. We show that alternative low-discrepancy sequences, also known as quasi-random sequences,…

Computational Physics · Physics 2019-10-14 D. V. Fedorov

We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension $D$ to increase with the…

Statistics Theory · Mathematics 2013-09-27 Larry Wasserman , Mladen Kolar , Alessandro Rinaldo

Let $S$ be a sequence of points in $\Omega ,$ where $\Omega$ is the unit ball or the unit polydisc in ${\mathbb{C}}^{n}.$ Denote $H^{p}$($\Omega $) the Hardy space of $\Omega .$ Suppose that $S$ is $H^{p}$ interpolating with $p\geq 2.$ Then…

Functional Analysis · Mathematics 2020-11-30 Eric Amar

In 1976, Rauzy studied two complexity functions, $\underline{\beta}$ and $\overline{\beta}$, for infinite sequences over a finite alphabet. The function $\underline{\beta}$ achieves its maximum precisely for Borel normal sequences, while…

Information Theory · Computer Science 2025-06-09 Verónica Becher , Olivier Carton , Santiago Figueira

We provide a general approach to obtain upper bounds for small deviations $ \mathbb{P}(\Vert y \Vert \le \epsilon)$ in different norms, namely the supremum and $\beta$- H\"older norms. The large class of processes $y$ under consideration…

Probability · Mathematics 2015-02-18 Ehsan Azmoodeh , Lauri Viitasaari

The quantum Haar random oracle model is an idealized model where every party has access to a single Haar random unitary and its inverse. We construct strong pseudorandom unitaries in the quantum Haar random oracle model. This strictly…

Quantum Physics · Physics 2025-09-30 Prabhanjan Ananth , John Bostanci , Aditya Gulati , Yao-Ting Lin

The complexity of a well-quasi-order (wqo) can be measured through three ordinal invariants: the width as a measure of antichains, height as a measure of chains, and maximal order type as a measure of bad sequences. We study these ordinal…

Logic in Computer Science · Computer Science 2024-07-19 Sergio Abriola , Simon Halfon , Aliaume Lopez , Sylvain Schmitz , Philippe Schnoebelen , Isa Vialard