Related papers: Trace Minimization and Roots in ${\rm PSL}(2,\math…
We present a new short proof of the explicit formula for the group of links (and also link maps) in the 'quadruple point free' dimension. Denote by $L^m_{p,q}$ (respectively, $C^{m-p}_p$) the group of smooth embeddings $S^p\sqcup S^q\to…
Over the past few years, trace regression models have received considerable attention in the context of matrix completion, quantum state tomography, and compressed sensing. Estimation of the underlying matrix from regularization-based…
In this paper, we analyze the fundamental conditions for low-rank tensor completion given the separation or tensor-train (TT) rank, i.e., ranks of unfoldings. We exploit the algebraic structure of the TT decomposition to obtain the…
In this paper the relationship between $S$-subgroups in $\Z_{2}^{n}$ and binary codes is shown. If the codes used are both $P(T)$-codes and $G$-codes, then the $S$-subgroup is free. The codes constructed are cyclic, decimated or symmetric…
This paper investigates defining equations for secant varieties of the variety of reducible polynomials, which geometrically encode the notions of strength and slice rank of homogeneous polynomials. We present three main results. First, we…
In the trace reconstruction problem our goal is to learn an unknown string $x\in \{0,1\}^n$ given independent traces of $x$. A trace is obtained by independently deleting each bit of $x$ with some probability $\delta$ and concatenating the…
In the trace reconstruction problem, one seeks to reconstruct a binary string $s$ from a collection of traces, each of which is obtained by passing $s$ through a deletion channel. It is known that $\exp(\tilde O(n^{1/5}))$ traces suffice to…
Let $R$ and $S$ be two sequences of nonnegative integers in nonincreasing order and with the same sum, and let ${\cal A}(R,S)$ be the class of all $(0,1)$-matrices having row sum $R$ and column sum $S$. For a positive integer $t$, the…
Let $[n]$ be a finite $n-$chain $\{1, 2, \dots, n\}$, and let $\mathcal{LS}_{n}$ be the Schr\"{o}der monoid, consisting of all isotone and order-decreasing partial transformations on $[n]$. Furthermore, let $\mathcal{SS}^{\prime}_{n} =…
In the present paper, which is a direct sequel of our papers [10,11,35] joint with Roozbeh Hazrat, we achieve a further dramatic reduction of the generating sets for commutators of relative elementary subgroups in Chevalley groups. Namely,…
We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…
Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. A submonoid $M$ generated by $k$ elements of $A^*$ is…
The problems of square root from group element existing in $SL_2(F_p)$, $PSL_2(F_p)$ and $GL_2(F_p)$ were solved. The similar goal of root finding was reached in the GM algorithm adjoining an $n$-th root of a generator results in a discrete…
We characterize classes of graphs closed under taking vertex-minors and having no $P_n$ and no disjoint union of $n$ copies of the $1$-subdivision of $K_{1,n}$ for some $n$. Our characterization is described in terms of a tree of radius $2$…
For any two partitions $\lambda$ and $\mu$ of a positive integer $N$, let $\chi_{\lambda}(\mu)$ be the value of the irreducible character of the symmetric group $S_{N}$ associated with $\lambda$, evaluated at the conjugacy class of elements…
We study representations of groups by "affine" automorphisms of compact, convex spaces, with special focus on "irreducible" representations: equivalently "minimal" actions. When the group in question is PSL(2,R), we exhibit a one-one…
We show in this paper that a sub-critical pair $(A,B)$ of sufficiently "spread-out" Borel sets in a compact and second countable group $K$ with an \emph{abelian} identity component, must reduce to a Sturmian pair in either $\bT$ or $\bT…
The trace algebra C(n,d) over a field of characteristic 0 is generated by all traces of products of d generic nxn matrices, n,d>1. Minimal sets of generators of C(n,d) are known for n=2 and n=3 for any d as well as for n=4 and n=5 and d=2.…
We study the Sparse Plus Low-Rank decomposition problem (SLR), which is the problem of decomposing a corrupted data matrix into a sparse matrix of perturbations plus a low-rank matrix containing the ground truth. SLR is a fundamental…
We give a necessary and sufficient condition on a positive compact operator $T$ for the existence of a singular trace (i.e. a trace vanishing on the finite rank operators) which takes a finite non-zero value on $T$. This generalizes…