English
Related papers

Related papers: Probability of super-regular matrices and MDS code…

200 papers

It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and…

Information Theory · Computer Science 2019-12-06 Weijun Fang , Fang-Wei Fu

The supersymmetric method is a powerful method for the evaluation of quenched averages in disordered systems. Among others, this method has been applied to the theory of S-matrix fluctuations, the theory of universal conductance…

High Energy Physics - Theory · Physics 2009-11-10 J. J. M. Verbaarschot

Two of the most fundamental distributed symmetry-breaking problems are that of finding a maximal independent set (MIS) and a maximal matching (MM) in a graph. It is a major open question whether these problems can be solved in constant…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-03 Keren Censor-Hillel , Tomer Even , Maxime Flin , Magnús M. Halldórsson

It is known that the empirical spectral distribution of random matrices obtained from linear codes of increasing length converges to the well-known Marchenko-Pastur law, if the Hamming distance of the dual codes is at least 5. In this…

Probability · Mathematics 2021-02-01 Chin Hei Chan , Vahid Tarokh , Maosheng Xiong

Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…

Number Theory · Mathematics 2023-08-16 Lior Bary-Soroker , Dimitris Koukoulopoulos , Gady Kozma

The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits.…

Numerical Analysis · Mathematics 2018-09-07 Emre Mengi

For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…

Combinatorics · Mathematics 2018-04-03 Bart Litjens

In this paper, we investigate the invertibility of sparse symmetric matrices. We show that for an $n\times n$ sparse symmetric random matrix $A$ with $A_{ij} = \delta_{ij} \xi_{ij}$ is invertible with high probability. Here, $\delta_{ij}$s,…

Probability · Mathematics 2018-04-26 Feng Wei

Recently, subfield codes of geometric codes over large finite fields $\gf(q)$ with dimension $3$ and $4$ were studied and distance-optimal subfield codes over $\gf(p)$ were obtained, where $q=p^m$. The key idea for obtaining very good…

Information Theory · Computer Science 2020-08-11 Ziling Heng , Cunsheng Ding

Let M be a b*b nonzero {0,1}-matrix. Let \rho(M) be its spectral radius and let |M^n| be the norm of its n-th iteration. In the case \rho(M)>1, we see from the spectral radius formula that {|M^n|}_{n=1}^\infty tends to \infty exponentially…

Spectral Theory · Mathematics 2021-12-13 Chun Wei , Fan Wen

Let $g(k)$ be the maximum size of a planar set that determines at most $k$ distances. We prove $$\frac{\pi}{3\,C(\Lambda_{hex})}\ k\sqrt{\log k} (1+o(1)) \le g(k) \le C k\log k,$$ so $g(k) \asymp k\sqrt{\log k}$ with an explicit constant…

Metric Geometry · Mathematics 2025-10-14 Lucas Wang

This article is devoted to the analysis of necessary and/or sufficient conditions for metric regularity in terms of Demyanov-Rubinov-Polyakova quasidifferentials. We obtain new necessary and sufficient conditions for the local metric…

Optimization and Control · Mathematics 2020-11-19 M. V. Dolgopolik

We are concerned with the general problem of proving the existence of joint distributions of two discrete random variables $M$ and $N$ subject to infinitely many constraints of the form $\mathbb{P}\left(M=i,N=j\right)=0$. In particular, the…

Probability · Mathematics 2020-03-18 Joseph Squillace

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the Hermitian…

Information Theory · Computer Science 2014-03-12 Bocong Chen , San Ling , Guanghui Zhang

Let $\mathcal B=\mathcal B_{k,n,p}$ be a random collection of $k$-subsets of $[n]$ where each possible set is present independently with probability $p$. Let $\cal E_{\mathcal B}$ be the event that $\mathcal B$ defines the set of bases of a…

Combinatorics · Mathematics 2026-05-11 Patrick Bennett , Alan Frieze

A tight upper bound is given on the distribution of the maximum of a supermartingale. Specifically, it is shown that if $Y$ is a semimartingale with initial value zero and quadratic variation process $[Y,Y]$ such that $Y + [Y,Y]$ is a…

Probability · Mathematics 2014-08-15 Bruce Hajek

Let $f:[0,1]^d\to\mathbb{R}$ be a completely monotone integrand as defined by Aistleitner and Dick (2015) and let points $\boldsymbol{x}_0,\dots,\boldsymbol{x}_{n-1}\in[0,1]^d$ have a non-negative local discrepancy (NNLD) everywhere in…

Numerical Analysis · Mathematics 2026-01-13 Michael Gnewuch , Peter Kritzer , Art B. Owen , Zexin Pan

Consider $M_n$ the maximal position at generation $n$ of a supercritical branching random walk. A\"id\'ekon (2013) obtained and described the convergence in law, as time $n$ goes to infinity, of $M_n-m_n$, where $m_n$ is an explicit…

Probability · Mathematics 2026-01-14 Louis Chataignier , Lianghui Luo

In this paper, we are interested in sequences of q-tuple of N-by-N random matrices having a strong limiting distribution (i.e. given any non-commutative polynomial in the matrices and their conjugate transpose, its normalized trace and its…

Operator Algebras · Mathematics 2016-01-26 Benoit Collins , Camille Male

Suppose $C \subset \mathbb{C}$ is compact. Let $q_k$ be a sequence of polynomials of degree $n_k \to \infty$, such that the locus of roots of all the polynomials is bounded, and the number of roots of $q_k$ in any closed set $L$ not meeting…

Complex Variables · Mathematics 2024-04-08 Christian Henriksen , Carsten Lunde Petersen , Eva Uhre