How long does it take to generate a group?

The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant by \diam_A(G). It can be interpreted as the diameter of the Cayley graph induced by $A$ on $G$ and arises, for instance, in the context of efficient communication networks. In this paper we study the diameters of a finite abelian group $G$ with respect to its various generating sets $A$. We determine the maximum possible value of \diam_A(G) and classify all generating sets for which this maximum value is attained. Also, we determine the maximum possible cardinality of $A$ subject to the condition that \diam_A(G) is "not too small". Connections with caps, sum-free sets, and quasi-perfect codes are discussed

Neural Networks Compression for Language Modeling

In this paper, we consider several compression techniques for the language modeling problem based on recurrent neural networks (RNNs). It is known that conventional RNNs, e.g, LSTM-based networks in language modeling, are characterized with either high space complexity or substantial inference time. This problem is especially crucial for mobile applications, in which the constant interaction with the remote server is inappropriate. By using the Penn Treebank (PTB) dataset we compare pruning, quantization, low-rank factorization, tensor train decomposition for LSTM networks in terms of model size and suitability for fast inference.Comment: Keywords: LSTM, RNN, language modeling, low-rank factorization, pruning, quantization. Published by Springer in the LNCS series, 7th International Conference on Pattern Recognition and Machine Intelligence, 201

Gauss composition over an arbitrary base

The classical theorems relating integral binary quadratic forms and ideal classes of quadratic orders have been of tremendous importance in mathematics, and many authors have given extensions of these theorems to rings other than the integers. However, such extensions have always included hypotheses on the rings, and the theorems involve only binary quadratic forms satisfying further hypotheses. We give a complete statement of the relationship between binary quadratic forms and modules for quadratic algebras over any base ring, or in fact base scheme. The result includes all binary quadratic forms, and commutes with base change. We give global geometric as well as local explicit descriptions of the relationship between forms and modules.Comment: submitte

The size of triangulations supporting a given link

Let T be a triangulation of S^3 containing a link L in its 1-skeleton. We give an explicit lower bound for the number of tetrahedra of T in terms of the bridge number of L. Our proof is based on the theory of almost normal surfaces.Comment: Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol5/paper13.abs.htm

Schrijver graphs and projective quadrangulations

In a recent paper [J. Combin. Theory Ser. B}, 113 (2015), pp. 1-17], the authors have extended the concept of quadrangulation of a surface to higher dimension, and showed that every quadrangulation of the $n$-dimensional projective space $P^n$ is at least $(n+2)$-chromatic, unless it is bipartite. They conjectured that for any integers $k\geq 1$ and $n\geq 2k+1$, the Schrijver graph $SG(n,k)$ contains a spanning subgraph which is a quadrangulation of $P^{n-2k}$. The purpose of this paper is to prove the conjecture

Converting between quadrilateral and standard solution sets in normal surface theory

The enumeration of normal surfaces is a crucial but very slow operation in algorithmic 3-manifold topology. At the heart of this operation is a polytope vertex enumeration in a high-dimensional space (standard coordinates). Tollefson's Q-theory speeds up this operation by using a much smaller space (quadrilateral coordinates), at the cost of a reduced solution set that might not always be sufficient for our needs. In this paper we present algorithms for converting between solution sets in quadrilateral and standard coordinates. As a consequence we obtain a new algorithm for enumerating all standard vertex normal surfaces, yielding both the speed of quadrilateral coordinates and the wider applicability of standard coordinates. Experimentation with the software package Regina shows this new algorithm to be extremely fast in practice, improving speed for large cases by factors from thousands up to millions.Comment: 55 pages, 10 figures; v2: minor fixes only, plus a reformat for the journal styl

Some open 3-manifolds and 3-orbifolds without locally finite canonical decompositions

We give examples of open 3-manifolds and 3-orbifolds that exhibit pathological behavior with respect to splitting along surfaces (2-suborbifolds) with nonnegative Euler characteristic.Comment: 17 pages, 5 figure