Related papers: Trace Minimization and Roots in ${\rm PSL}(2,\math…

We study the action of G = SL(2,R) on its type space S_G(R) where R denotes the field of real numbers. We identify a minimal closed G-flow I, and an idempotent r of I (with the respect to the Ellis semigroup structure * on I). We show that…

Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…

This article studies the equation $[A,B]^k = {\rm Id}_n$ for matrices over $\mathbb{C}$, characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next…

If $K$ is a closed subgroup of a compact group $G$, the probability that randomly chosen pair of elements from $K$ and $G$ commute is denoted by $Pr(K,G)$. Say that a subgroup $K\leq G$ is $\epsilon$-central in $G$ if $Pr(\langle g…

A {\it sign pattern matrix} is a matrix whose entries are from the set $\{+,-, 0\}$. The minimum rank of a sign pattern matrix $A$ is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries…

A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…

Let $\mathcal R$ be a principal ideal domain and $\mathcal K = {\rm quot}(\mathcal R)$. Assume that $P_1,\ldots P_n\in \mathcal K[X]$ are polynomials which take $\mathcal R$ to $\mathcal R$, and $P$ is their product. If the $P_i$ satisfy…

Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…

We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…

We classify the connected Lie subgroups of the symplectic group $Sp(2,\mathbb{R})$ whose elements are matrices in block lower triangular form. The classification is up to conjugation within $Sp(2,\mathbb{R})$. Their study is motivated by…

A natural generalization of Krein's theorem to a pair of commuting tuples $\left(H_1^0,H_2^0\right)$ and $\left(H_1,H_2\right)$ of bounded self-adjoint operators in a separable Hilbert space $\mathcal{H}$ with $H_j-H_j^0 = V_j\in…

Let $M$ be chosen uniformly at random w.r.t. the Haar measure on the unitary group $U_n$, the unitary symplectic group $USp_{2n}$ or the orthogonal group $O_n$. Diaconis and Shashahani proved that the traces…

The product replacement algorithm is a practical algorithm to construct random elements of a finite group G. It can be described as a random walk on a graph whose vertices are the generating k-tuples of G (for a fixed k). We show that if G…

Representations of braid group obtained from rational conformal field theories can be used to obtain explicit representations of Temperley-Lieb-Jones algebras. The method is described in detail for SU(2)$_k$ Wess - Zumino conformal field…

Let $(S,*)$ be an involutive local ring and let $U(2m,S)$ be the unitary group associated to a nondegenerate skew hermitian form defined on a free $S$-module of rank $2m$. A presentation of $U(2m,S)$ is given in terms of Bruhat generators…

The main goal of this paper is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result from (Vereshchagin, 2002) saying that $\limsup_n\KS(x|n)$ (here $\KS(x|n)$ is…

The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization…

In the beautifully simple-to-state problem of trace reconstruction, the goal is to reconstruct an unknown binary string $x$ given random "traces" of $x$ where each trace is generated by deleting each coordinate of $x$ independently with…

For integers $n\ge s\ge 2$ let $e(n,s)$ denote the maximum of $|\mathcal F|,$ where $\mathcal F$ is a family of subsets of an $n$-element set and $\mathcal F$ contains no $s$ pairwise disjoint members. Half a century ago, solving a…

We specialize the Eichler-Selberg trace formula to obtain trace formulas for the prime-to-level Hecke action on cusp forms for certain congruence groups of arbitrary level. As a consequence, we determine the asymptotic in the prime p of the…