English
Related papers

Related papers: Discrepancy bounds for infinite-dimensional order …

200 papers

In any infinite dimensional Hilbert space $\mathcal H$ there exist orthogonal projections $Q_1$, $Q_2$ and $Q_3$, such that a sequence $(P_n... P_1(x))$ diverges in norm for some $P_1,P_2,...\in\{Q_1,Q_2,Q_3\}$ and $x\in\mathcal H$.

Functional Analysis · Mathematics 2012-08-07 Adam Paszkiewicz

The central problem in sequence reconstruction is to find the minimum number of distinct channel outputs required to uniquely reconstruct the transmitted sequence. According to Levenshtein's work in 2001, this number is determined by the…

Information Theory · Computer Science 2025-02-14 Wentu Song , Kui Cai , Tony Q. S. Quek

Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n grows while q and d are fixed. For any d and q<=d-1, long algebraic codes are…

Information Theory · Computer Science 2007-07-13 Sergey Yekhanin , Ilya Dumer

In this paper, we consider finite difference approximations of the second order wave equation. We use finite difference operators satisfying the summation-by-parts property to discretize the equation in space. Boundary conditions and grid…

Numerical Analysis · Mathematics 2015-09-04 Siyang Wang , Gunilla Kreiss

Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements, which satisfies $|E| > q$. There exist $x,y \in E$ such that $|E \cdot (y-x)| > q/2.$ In particular, $(E+E) \cdot (E-E) =…

Combinatorics · Mathematics 2017-06-20 Giorgis Petridis

Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…

Information Theory · Computer Science 2017-10-13 Kriangkrai Boonniyom , Somphong Jitman

We discuss the universal behaviour of scattering cross sections in the limit of infinite rapidity separation between all produced particles, and illustrate the behaviour explicitly for the production of n jets, W+n jets, Z+n jets for…

High Energy Physics - Phenomenology · Physics 2010-01-22 Jeppe R. Andersen , Jennifer M. Smillie

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

Combinatorics · Mathematics 2023-03-21 Toby Aldape , Jingyi Liu , Gregory Pylypovych , Adam Sheffer , Minh-Quan Vo

Given two distributions $\mathcal{P}$ and $\mathcal{Q}$ over a high-dimensional domain $\{0,1\}^n$, and a parameter $\varepsilon$, the goal of distance estimation is to determine the statistical distance between $\mathcal{P}$ and…

Data Structures and Algorithms · Computer Science 2025-09-09 Gunjan Kumar , Kuldeep S. Meel , Yash Pote

For $q,n,d \in \mathbb{N}$, let $A_q(n,d)$ be the maximum size of a code $C \subseteq [q]^n$ with minimum distance at least $d$. We give a divisibility argument resulting in the new upper bounds $A_5(8,6) \leq 65$, $A_4(11,8)\leq 60$ and…

Combinatorics · Mathematics 2018-08-07 Sven Polak

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

Symbolic Computation · Computer Science 2024-10-08 Sergei Abramov , Gleb Pogudin

A Langford sequence of order $m$ and defect $d$ can be identified with a labeling of the vertices of a path of order $2m$ in which each labeled from $d$ up to $d+m-1$ appears twice and in which the vertices that have been label with $k$ are…

Combinatorics · Mathematics 2015-06-18 S. C. López , F. A. Muntaner-Batle

A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes…

Combinatorics · Mathematics 2026-04-07 Hengfeng Liu , Chunming Tang , Zhengchun Zhou , Dongchun Han , Hao Chen

We propose a class of incompatibility measures for quantum observables based on quantifying the effect of a measurement of one observable on the statistics of the outcomes of another. Specifically, for a pair of observables $A$ and $B$ with…

Quantum Physics · Physics 2014-09-30 Prabha Mandayam , M. D. Srinivas

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…

Combinatorics · Mathematics 2019-08-21 Bryce McLaughlin , Mohamed Omar

In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…

Information Theory · Computer Science 2025-01-29 Puyin Wang , Jinquan Luo

We derive finite difference equations of infinite order for theta hypergeometric series and investigate the space of their solutions. In general, such infinite series diverge, we describe some constraints on the parameters when they do…

Classical Analysis and ODEs · Mathematics 2023-09-29 D. I. Krotkov , V. P. Spiridonov

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

Number Theory · Mathematics 2026-03-31 Andreea Catalina Chitu , Gabriela Ileana Sebe , Dan Lascu

By a profound result of Heinrich, Novak, Wasilkowski, and Wo{\'z}niakowski the inverse of the star-discrepancy $n^*(s,\ve)$ satisfies the upper bound $n^*(s,\ve) \leq c_{\mathrm{abs}} s \ve^{-2}$. This is equivalent to the fact that for any…

Numerical Analysis · Mathematics 2012-11-07 Christoph Aistleitner , Markus Hofer

We study two-to-two parton scattering amplitudes in the high-energy limit of perturbative QCD by iteratively solving the BFKL equation. This allows us to predict the imaginary part of the amplitude to leading-logarithmic order for arbitrary…

High Energy Physics - Phenomenology · Physics 2020-06-03 Simon Caron-Huot , Einan Gardi , Joscha Reichel , Leonardo Vernazza