A two-sided analogue of the Coxeter complex

For any Coxeter system $(W,S)$ of rank $n$, we introduce an abstract boolean complex (simplicial poset) of dimension $2n-1$ that contains the Coxeter complex as a relative subcomplex. Faces are indexed by triples $(I,w,J)$, where $I$ and $J$ are subsets of the set $S$ of simple generators, and $w$ is a minimal length representative for the parabolic double coset $W_I w W_J$. There is exactly one maximal face for each element of the group $W$. The complex is shellable and thin, which implies the complex is a sphere for the finite Coxeter groups. In this case, a natural refinement of the $h$-polynomial is given by the "two-sided" $W$-Eulerian polynomial, i.e., the generating function for the joint distribution of left and right descents in $W$.Comment: 26 pages, several large tables and figure

A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes

In this paper, we study the impact of locality on the decoding of binary cyclic codes under two approaches, namely ordered statistics decoding (OSD) and trellis decoding. Given a binary cyclic code having locality or availability, we suitably modify the OSD to obtain gains in terms of the Signal-To-Noise ratio, for a given reliability and essentially the same level of decoder complexity. With regard to trellis decoding, we show that careful introduction of locality results in the creation of cyclic subcodes having lower maximum state complexity. We also present a simple upper-bounding technique on the state complexity profile, based on the zeros of the code. Finally, it is shown how the decoding speed can be significantly increased in the presence of locality, in the moderate-to-high SNR regime, by making use of a quick-look decoder that often returns the ML codeword.Comment: Extended version of a paper submitted to ISIT 201

Beating the Generator-Enumeration Bound for pp-Group Isomorphism

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime dividing the order of the group) has been the best worst-case result for general groups. In this work, we show the first improvement over the generator-enumeration bound for p-groups, which are believed to be the hard case of the group isomorphism problem. We start by giving a Turing reduction from group isomorphism to n^((1 / 2) log_p n + O(1)) instances of p-group composition-series isomorphism. By showing a Karp reduction from p-group composition-series isomorphism to testing isomorphism of graphs of degree at most p + O(1) and applying algorithms for testing isomorphism of graphs of bounded degree, we obtain an n^(O(p)) time algorithm for p-group composition-series isomorphism. Combining these two results yields an algorithm for p-group isomorphism that takes at most n^((1 / 2) log_p n + O(p)) time. This algorithm is faster than generator-enumeration when p is small and slower when p is large. Choosing the faster algorithm based on p and n yields an upper bound of n^((1 / 2 + o(1)) log n) for p-group isomorphism.Comment: 15 pages. This is an updated and improved version of the results for p-groups in arXiv:1205.0642 and TR11-052 in ECC

Computation of Galois groups of rational polynomials

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in the application of Stauduhar's method is to find, for a given pair of groups H<G a G-relative H-invariant, that is a multivariate polynomial F that is H-invariant, but not G-invariant. While generic, theoretical methods are known to find such F, in general they yield impractical answers. We give a general method for computing invariants of large degree which improves on previous known methods, as well as various special invariants that are derived from the structure of the groups. We then apply our new invariants to the task of computing the Galois groups of polynomials over the rational numbers, resulting in the first practical degree independent algorithm.Comment: Improved version and new titl

Complete spectrum of the infinite-UU Hubbard ring using group theory

We present a full analytical solution of the multiconfigurational strongly-correlated mixed-valence problem corresponding to the $N$-Hubbard ring filled with $N-1$ electrons, and infinite on-site repulsion. While the eigenvalues and the eigenstates of the model are known already, analytical determination of their degeneracy is presented here for the first time. The full solution, including degeneracy count, is achieved for each spin configuration by mapping the Hubbard model into a set of Huckel-annulene problems for rings of variable size. The number and size of these effective Huckel annulenes, both crucial to obtain Hubbard states and their degeneracy, are determined by solving a well-known combinatorial enumeration problem, the necklace problem for $N-1$ beads and two colors, within each subgroup of the $C_{N-1}$ permutation group. Symmetry-adapted solution of the necklace enumeration problem is finally achieved by means of the subduction of coset representation technique [S. Fujita, Theor. Chim. Acta 76, 247 (1989)], which provides a general and elegant strategy to solve the one-hole infinite-$U$ Hubbard problem, including degeneracy count, for any ring size. The proposed group theoretical strategy to solve the infinite-$U$ Hubbard problem for $N-1$ electrons, is easily generalized to the case of arbitrary electron count $L$, by analyzing the permutation group $C_L$ and all its subgroups.Comment: 31 pages, 4 figures. Submitte

On spaces of Conradian group orderings

We classify $C$-orderable groups admitting only finitely many $C$-orderings. We show that if a $C$-orderable group has infinitely many $C$-orderings, then it actually has uncountably many $C$-orderings, and none of these is isolated in the space of $C$-orderings. As a relevant example, we carefully study the case of Baumslag-Solitar's group B(1,2). We show that B(1,2) has four $C$-orderings, each of which is bi-invariant, but its space of left-orderings is homeomorphic to the Cantor set