Tropicalizing the simplex algorithm

We develop a tropical analog of the simplex algorithm for linear programming. In particular, we obtain a combinatorial algorithm to perform one tropical pivoting step, including the computation of reduced costs, in O(n(m+n)) time, where m is the number of constraints and n is the dimension.Comment: v1: 35 pages, 7 figures, 4 algorithms; v2: improved presentation, 39 pages, 9 figures, 4 algorithm

Algebraic and Computer-based Methods in the Undirected Degree/diameter Problem - a Brief Survey

This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter

Digraphs and cycle polynomials for free-by-cyclic groups

Let \phi \in \mbox{Out}(F_n) be a free group outer automorphism that can be represented by an expanding, irreducible train-track map. The automorphism $\phi$ determines a free-by-cyclic group $\Gamma=F_n \rtimes_\phi \mathbb Z,$ and a homomorphism $\alpha \in H^1(\Gamma; \mathbb Z)$. By work of Neumann, Bieri-Neumann-Strebel and Dowdall-Kapovich-Leininger, $\alpha$ has an open cone neighborhood $\mathcal A$ in $H^1(\Gamma;\mathbb R)$ whose integral points correspond to other fibrations of $\Gamma$ whose associated outer automorphisms are themselves representable by expanding irreducible train-track maps. In this paper, we define an analog of McMullen's Teichm\"uller polynomial that computes the dilatations of all outer automorphism in $\mathcal A$.Comment: 41 pages, 20 figure

The spectra of lifted digraphs

We present a method to derive the complete spectrum of the lift \mathrm{\Gamma\alpha} of a base digraph \mathrm{\Gamma}, with voltage assignment α on a (finite) group $\textit{G}$. The method is based on assigning to \mathrm{\Gamma} a quotient-like matrix whose entries are elements of the group algebra \mathds{C}[$\textit{G}$], which fully represents \mathrm{\Gamma\alpha}. This allows us to derive the eigenvectors and eigenvalues of the lift in terms of those of the base digraph and the irreducible characters of G. Thus, our main theorem generalizes some previous results of Lovász and Babai concerning the spectra of Cayley digraphs

Recent trends and future directions in vertex-transitive graphs

A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex set. Some recent developments and possible future directions regarding two famous open problems, asking about existence of Hamilton paths and existence of semiregular automorphisms in vertex-transitive graphs, are discussed, together with some recent results on arc-transitive graphs and half-arc-transitive graphs, two special classes of vertex-transitive graphs that have received particular attention over the last decade