Related papers: $\lambda$-fold near-factorizations of groups
Noncommutative near-group fusion categories were completely classified in the previous work of the first named author by using an operator algebraic method (and hence under the assumption of unitarity), and they were shown to be group…
Let $S$ be a class of groups and let $f_S (n)$ be the number of isomorphism classes of groups in $S$ of order $n$. Let $f(n)$ count the number of groups of order $n$ up to isomorphism. The asymptotic bounds for $f(n)$ behave differently…
We construct the first known infinite family of quasi-isometry classes of subgroups of hyperbolic groups which are not hyperbolic and are of type $\mathrm{FP}(\mathbb{Q})$. We give a simple criterion for producing many non-hyperbolic…
Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…
Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…
We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…
In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
A $1$-factorization of the complete multigraph $\lambda K_{2n}$ is said to be indecomposable if it cannot be represented as the union of $1$-factorizations of $\lambda_0 K_{2n}$ and $(\lambda-\lambda_0) K_{2n}$, where $\lambda_0<\lambda$.…
Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…
In this PhD thesis we discuss methods of recognizing finite groups by the structure of normalizers of certain 3-subgroups. We explain a method for characterizing groups using character theoretic and block theoretic methods and we use these…
By adapting the classical proof of Jordan's theorem on finite subgroups of linear groups, we show that every approximate subgroup of the unitary group U_n(C) is almost abelian.
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…
We give a brief introduction to the notion of an 'approximate group' and some of its numerous applications.
In this paper, we study approximate Hadamard matrices, that is, well-conditioned $n\times n$ matrices with all entries in $\{\pm1\}$. We show that the smallest-possible condition number goes to $1$ as $n\to\infty$, and we identify some…
In this last article of the series on outer actions of a countable dicrete amenable group on AFD factors, we analyze outer actions of a countable discrete free abelian group on an AFD factor of type $\text{III}_\lambda$, $0<\lambda< 1$, and…
We prove the equality $\cat(\phi)=\cd(\phi)$ for epimorphisms $\phi:\Gamma\to \Lambda$ between torsion-free, finitely generated almost nilpotent groups $\Gamma$ and $\Lambda$. In addition, we prove the equality $\cat(\phi)=\cd(\phi)$ for…
We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…
We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…
The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…