Search

Let $K$ be a field and $F$ a free group. By a classical result of Cohn and Lewin, the free group algebra $K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a well-defined rank. Given a finitely generated right ideal $I\leq K\left[F\right]$ and an element $f\in I$, we give an explicit algorithm determining whether $f$ is part of some basis of $I$. More generally, given free $K[F]$-modules $M\le N$, we provide algorithms determining whether $M$ is a free summand of $N$, and whether $N$ admits a free splitting relative to $M$. These can also be used to obtain analogous algorithms for free groups $H\le J$. As an aside, we also provide an algorithm to compute the intersection of two given submodules of a free $K\left[F\right]$-module. A key feature of this work is the introduction of a duality, induced by a matrix with entries in a free ideal ring, between the respective algebraic extensions of its column and row spaces., Comment: 35 pages

Fix a finite field $K$ of order $q$ and a word $w$ in a free group $F$ on $r$ generators. A $w$-random element in $GL_N(K)$ is obtained by sampling $r$ independent uniformly random elements $g_1,\ldots,g_r\in GL_N(K)$ and evaluating $w\left(g_1,\ldots,g_r\right)$. Consider $\mathbb{E}_w\left[\mathrm{fix}\right]$, the average number of vectors in $K^{N}$ fixed by a $w$-random element. We show that $\mathbb{E}_{w}\left[\mathrm{fix}\right]$ is a rational function in $q^{N}$. Moreover, if $w=u^{d}$ with $u$ a non-power, then the limit $\lim_{N\to\infty}\mathbb{E}_{w}\left[\mathrm{fix}\right]$ depends only on $d$ and not on $u$. These two phenomena generalize to all stable characters of the groups $\left\{ GL_N(K)\right\}_{N}$. A main feature of this work is the connection we establish between word measures on $GL_N(K)$ and the free group algebra $K\left[F\right]$. A classical result of Cohn [1964] and Lewin [1969] is that every one-sided ideal of $K\left[F\right]$ is a free $K\left[F\right]$-module with a well-defined rank. We show that for $w$ a non-power, $\mathbb{E}_{w}\left[\mathrm{fix}\right]=2+\frac{C}{q^{N}}+O\left(\frac{1}{q^{2N}}\right)$, where $C$ is the number of rank-2 right ideals $I\le K\left[F\right]$ which contain $w-1$ but not as a basis element. We describe a full conjectural picture generalizing this result, featuring a new invariant we call the $q$-primitivity rank of $w$. In the process, we prove several new results about free group algebras. For example, we show that if $T$ is any finite subtree of the Cayley graph of $F$, and $I\le K\left[F\right]$ is a right ideal with a generating set supported on $T$, then $I$ admits a basis supported on $T$. We also prove an analogue of Kaplansky's unit conjecture for certain $K\left[F\right]$-modules., Comment: 39 pages, 2 figures; Journal version, after a minor revision and with updated references

Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum speed-up. The search for new quantum algorithms benefits from understanding their limitations: Some tasks are impossible in quantum circuits, although their classical versions are easy, for example, cloning. An example with a unitary oracle $U$ is the if clause, the task to implement controlled $U$ (up to the phase on $U$). In classical computation the conditional statement is easy and essential. In quantum circuits the if clause was shown impossible from one query to $U$. Is it possible from polynomially many queries? Here we unify algorithms with a unitary oracle and develop a topological method to prove their limitations: No number of queries to $U$ and $U^\dagger$ lets quantum circuits implement the if clause, even if admitting approximations, postselection and relaxed causality. We also show limitations of process tomography, oracle neutralization, and $\sqrt[\dim U]{U}$, $U^T$, and $U^\dagger$ algorithms. Our results strengthen an advantage of linear optics, challenge the experiments on relaxed causality, and motivate new algorithms with many-outcome measurements., Comment: 14 pages, 8 figures, 2 tables + Appendix: 12 pages, 1 figure. Rewritten version, some results about unitary oracle tasks strengthened to approximations

In this paper we show that given a circle packing of an infinite planar triangulation such that its carrier is parabolic, placing weights on the edges according to a certain natural way introduced by Dubejko, makes the random walk recurrent. We also propose a higher-dimensional analogue of the Dubejko weights., Comment: 26 pages, 9 figures