English
Related papers

Related papers: Almost Separable Matrices

200 papers

We consider the class of {\em separable} $k$-hypergraphs, which can be viewed as uniform analogs of threshold Boolean functions, and the class of {\em equatable} $k$-hypergraphs. We show that every $k$-hypergraph is either separable or…

Optimization and Control · Mathematics 2023-03-23 Daniel Deza , Shmuel Onn

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

Combinatorics · Mathematics 2021-06-29 Hedongliang Liu , Nikita Polyanskii , Ilya Vorobyev , Antonia Wachter-Zeh

In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…

Operator Algebras · Mathematics 2020-12-29 Clayton Suguio Hida

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every algebraic isomorphism from the $S$-ring in question to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial…

Combinatorics · Mathematics 2020-12-29 Grigory Ryabov

Let $A$ be an $N \times N$ Fourier matrix over $\mathbb{F}_p^{\log{N}/\log{p}}$ for some prime $p$. We improve upon known lower bounds for the number of rows of $A$ that must be sampled so that the resulting matrix $M$ satisfies the…

Information Theory · Computer Science 2019-03-29 Shravas Rao

A countable group G is called k-linear sofic (for some 0 <k \le 1) if finite subsets of G admit "approximate representations" by complex invertible matrices in the normalized rank metric, so that non-identity elements are k-away from the…

Group Theory · Mathematics 2025-04-02 Keivan Mallahi-Karai , Maryam Mohammadi Yekta

We say that an indecomposable Cartan matrix A with entries in the ground field of characteristic 0 is almost affine if the Lie sub(super)algebra determined by it is not finite dimensional or affine but the Lie (super)algebra determined by…

Rings and Algebras · Mathematics 2024-09-17 Danil Chapovalov , Maxim Chapovalov , Alexei Lebedev , Dimitry Leites

We consider strong external difference families (SEDFs); these are external difference families satisfying additional conditions on the patterns of external diferences that occur, and were first defined in the context of classifying optimal…

Combinatorics · Mathematics 2016-11-18 Sophie Huczynska , Maura B. Paterson

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Rings and Algebras · Mathematics 2018-10-03 Giulio Peruginelli

In a group testing scheme, a set of tests is designed to identify a small number $t$ of defective items that are present among a large number $N$ of items. Each test takes as input a group of items and produces a binary output indicating…

Information Theory · Computer Science 2016-11-17 Arya Mazumdar

We consider the following problem: Given a matrix A, find minimal subsets of columns of A with cardinality no larger than a given bound that are linear dependent or nearly so. This problem arises in various forms in optimization, electrical…

Numerical Analysis · Mathematics 2008-04-23 Hans Engler

The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of…

Quantum Physics · Physics 2007-05-23 Pawel Wocjan , Michal Horodecki

For an arbitrary prime $p$ we prove that the proportion of entries divisible by $p$ in certain columns of the character table of the symmetric group $S_n$ tends to 1 as $n\to\infty$. This is done by finding lower bounds on the number of…

Combinatorics · Mathematics 2019-10-31 Lucia Morotti

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Number Theory · Mathematics 2012-11-06 Maria Bras-Amorós , Pedro A. García-Sánchez , Albert Vico-Oton

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

A linear map between real symmetric matrix spaces is positive if all positive semidefinite matrices are mapped to positive semidefinite ones. A real symmetric matrix is separable if it can be written as a summation of Kronecker products of…

Optimization and Control · Mathematics 2016-03-29 Jiawang Nie , Xinzhen Zhang

Having observed an $m\times n$ matrix $X$ whose rows are possibly correlated, we wish to test the hypothesis that the columns are independent of each other. Our motivation comes from microarray studies, where the rows of $X$ record…

Applications · Statistics 2009-10-09 Bradley Efron

Separability from the spectrum is a significant and ongoing research topic in quantum entanglement. In this study, we investigate properties related to absolute separability from the spectrum in qudits-qudits states in the bipartite states…

Quantum Physics · Physics 2024-08-22 Liang Xiong , Nung-Sing Sze

We prove that the algebraic set of pairs of matrices with a diagonal commutator over a field of positive prime characteristic, its irreducible components, and their intersection are $F$-pure when the size of matrices is equal to 3.…

Commutative Algebra · Mathematics 2017-12-15 Zhibek Kadyrsizova

When branching for binary mixed integer linear programs with disjunctions of sparsity level $2$, we observe that there exists a finite list of $2$-sparse disjunctions, such that any other $2$-sparse disjunction is dominated by one…

Optimization and Control · Mathematics 2024-08-13 Santanu S. Dey , Diego Moran , Jingye Xu