arXiv subjects

Uriya First

Publications and source records attributed to Uriya First.

5 recordsLinked to original sources

arXiv2025

Good Locally Testable Codes with Small Alphabet and Small Query Size

Ben-Sasson, Goldreich and Sudan showed that a binary error correcting code admitting a $2$-query tester cannot be good, i.e., it cannot have both linear distance and constant rate. They also showed that there are no good codes if the alphabet is a finite field $\mathbb{F}$, the code is $\mathbb{F}$-linear, and the $2$-query tester is $\mathbb{F}$-linear. We show that those are essentially the only limitations on the existence of good locally testable codes (LTCs). That is, there are good $2$-query LTCs on any alphabet with more than $2$ letters, and good $3$-query LTCs with a binary alphabet. Similarly, there are good $3$-query $\mathbb{F}$-linear LTCs, and for every $\mathbb{F}$-vector space $V$ of dimension greater than $1$, there are good $2$-query LTCs with alphabet $V$ whose tester is $\mathbb{F}$-linear. This completely solves, for every $q\geq 2$ and alphabet (resp. $\mathbb{F}$-vector space) $\Sigma$, the question of whether there is a good $q$-query LTC (resp. $\mathbb{F}$-LTC) with alphabet $\Sigma$. Our proof builds on the recent good $2$-query $\mathbb{F}$-LTCs of the first author and Kaufman, by establishing a general method for reducing the alphabet size of a good low-query LTC.

cs.CC↗

arXiv2025

Irredundant Generating Sets for Matrix Algebras

Let $F$ be a field. We show that the largest irredundant generating sets for the algebra of $n\times n $ matrices over $F$ have $2n-1$ elements when $n>1$. (A result of Laffey states that the answer is $2n-2$ when $n>2$, but its proof contains an error.) We further give a classification of the largest irredundant generating sets when $n\in\{2,3\}$ and $F$ is algebraically closed. We use this description to compute the dimension of the variety of $(2n-1)$-tuples of $n\times n$ matrices which form an irredundant generating set when $n\in\{2,3\}$, and draw some consequences to Zariski-locally redundant generation of Azumaya algebras. In the course of proving the classification, we also determine the largest sets $S$ of subspaces of $F^3$ with the property that every $V\in S$ admits a matrix stabilizing every subspace in $S-\{V\}$ and not stabilizing $V$.

math.RA↗

arXiv2024

Counterexamples in Involutions of Azumaya Algebras

Suppose $A$ is an Azumaya algebra over a ring $R$ and $\sigma$ is an involution of $A$ extending an order-$2$ automorphism $\lambda:R\to R$. We say $\sigma$ is extraordinary if there does not exist a Brauer-trivial Azumaya algebra $\mathrm{End}_R(P)$ over $R$ carrying an involution $\tau$ so that $(A, \sigma)$ and $(\mathrm{End}_R(P), \tau)$ become isomorphic over some faithfully flat extension of the fixed ring of $\lambda:R\to R$. We give, for the first time, an example of such an algebra and involution. We do this by finding suitable cohomological obstructions and showing they do not always vanish. We also give an example of a commutative ring $R$ with involution $\lambda$ so that the scheme-theoretic fixed locus $Z$ of $\lambda:\mathrm{Spec} R\to \mathrm{Spec} R$ is disconnected, but such that every Azumaya algebra over $R$ with involution extending $\lambda$ is either orthogonal at every point of $Z$, or symplectic at every point of $Z$. No examples of this kind were previously known.

math.RA↗

arXiv2019

A spectral theory for transverse tensor operators

Tensors are multiway arrays of data, and transverse operators are the operators that change the frame of reference. We develop the spectral theory of transverse tensor operators and apply it to problems closely related to classifying quantum states of matter, isomorphism in algebra, clustering in data, and the design of high performance tensor type-systems. We prove the existence and uniqueness of the optimally-compressed tensor product spaces over algebras, called \emph{densors}. This gives structural insights for tensors and improves how we recognize tensors in arbitrary reference frames. Using work of Eisenbud--Sturmfels on binomial ideals, we classify the maximal groups and categories of transverse operators, leading us to general tensor data types and categorical tensor decompositions, amenable to theorems like Jordan--H\"older and Krull--Schmidt. All categorical tensor substructure is detected by transverse operators whose spectra contain a Stanley--Reisner ideal, which can be analyzed with combinatorial and geometrical tools via their simplicial complexes. Underpinning this is a ternary Galois correspondence between tensor spaces, multivariable polynomial ideals, and transverse operators. This correspondence can be computed in polynomial time. We give an implementation in the computer algebra system \textsf{Magma}.

math.SP↗

arXiv2017

On the number of generators of a separable algebra over a finite field

Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is generated by one element as an $F$-algebra. The same is true for any $r \geqslant 1$, provided that $F$ is infinite. However, if $F$ is a finite field and $r \geqslant 2$, the primitive element theorem fails in general. In this paper we give a formula for the minimal number of generators of $E$ when $F$ is finite. We also obtain upper and lower bounds on the number of generators of a (not necessarily commutative) separable algebra over a finite field.

math.NT↗