Related papers: An Explicit Formula for Vertex Enumeration in the …
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
Let $\Gamma$ be an $N\times n$ random matrix with independent entries and such that in each row entries are i.i.d. Assume also that the entries are symmetric, have unit variances, and satisfy a small ball probabilistic estimate uniformly.…
We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…
Maps are polygonal cellular networks on Riemann surfaces. This paper analyzes the construction of closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. The method of…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
We present an algorithm for approximately solving bounded convex vector optimization problems. The algorithm provides both an outer and an inner polyhedral approximation of the upper image. It is a modification of the primal algorithm…
The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior…
We consider the algebraic K-theory of a truncated polynomial algebra in several commuting variables, K(k[x_1, ..., x_n]/(x_1^a_1, ..., x_n^a_n)). This naturally leads to a new generalization of the big Witt vectors. If k is a perfect field…
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…
It is well-known that the Eulerian polynomials, which count permutations in $S_n$ by their number of descents, give the $h$-polynomial/$h$-vector of the simple polytopes known as permutohedra, the convex hull of the $S_n$-orbit for a…
In this paper we show how to construct inner and outer convex approximations of a polytope from an approximate cone factorization of its slack matrix. This provides a robust generalization of the famous result of Yannakakis that polyhedral…
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the $n!$ Hamilton cycles in a complete directed graph on $n+1$ vertices corresponds with each of the $n!$ $n$-permutation matrices $P$,…
We determine, in an inductive framework, the vertices of the polytope $P(s,K)$ controlling the conjugacy classes of elements which product to one in the maximal compact subgroup $K$ of a simple complex algebraic group $G$. This extends…
The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump-type Markov processes, established under simple conditions on the Laplace…
In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…
A polytope $P$ is a {\em model} for a combinatorial problem on finite graphs $G$ whose variables are indexed by the edge set $E$ of $G$ if the points of $P$ with (0,1)-coordinates are precisely the characteristic vectors of the subset of…
A tight map is a map with some of its vertices marked, such that every vertex of degree $1$ is marked. We give an explicit formula for the number $N_{0,n}(d_1,\ldots,d_n)$ of planar tight maps with $n$ labeled faces of prescribed degrees…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We present near-optimal algorithms for detecting small vertex cuts in the CONGEST model of distributed computing. Despite extensive research in this area, our understanding of the vertex connectivity of a graph is still incomplete,…