Related papers: Topological complexity of planar polygon spaces wi…
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
Unordered flag manifolds are the manifolds of unordered $n$-tuple of mutually orthogonal lines in $\mathbb{R}^n$. In this paper, we develop some basic tools to compute the mod-$2$ cohomology groups of these spaces, and apply them for…
Irreducible isoparametric foliations of arbitrary codimension q on complex projective spaces CP^n are classified, except if n=15 and q=1. Remarkably, there are noncongruent examples that pull back under the Hopf map to congruent foliations…
We prove a complexity dichotomy theorem for counting planar graph homomorphisms of domain size 3. Given any 3 by 3 real valued symmetric matrix $H$ defining a graph homomorphism from all planar graphs $G \mapsto Z_H(G)$, we completely…
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…
We adapt linear programming methods from sphere packings to closed hyperbolic surfaces and obtain new upper bounds on their systole, their kissing number, the first positive eigenvalue of their Laplacian, the multiplicity of their first…
We prove various results on the cohomology of arithmetic lattices arising from quaternion algebras over a number field with at least one complex place, including a strong restriction on the allowable weights of cuspidal cohomological…
In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…
We study parametrized families of orthogonal projections for which the dimension of the parameter space is strictly less than that of the Grassmann manifold. We answer the natural question of how much the Hausdorff dimension may decrease by…
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for…
In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…
We have initiated the study of topology of the space of coverings on grid domains. The space has the following constraint: while all the covering agents can move freely (we allow overlapping) on the domain, their union must cover the whole…
A topological constraint on the possible values of the universal quantization parameter is revealed in the case of geometric quantization on (boundary) curves diffeomorphic to $S^1$, analytically extended on a bounded domain in…
We survey and expand on the work of Segal, Milgram and the author on the topology of spaces of maps of positive genus curves into $n$-th complex projective space, $n\geq 1$ (in both the holomorphic and continuous categories). Both based and…
For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…
We introduce the simple parametrization for the space of codons (triples of nucleotides) by 8\times 8 table. This table (which we call the dyadic plane) possesses the natural 2-adic ultrametric. We show that after this parametrization the…
Given a lattice polygon $P$ with $g$ interior lattice points, we associate to it the moduli space of tropical curves of genus $g$ with Newton polygon $P$. We completely classify the possible dimensions such a moduli space can have. For…
Building on our previous joint work with A. Schmitt [7] we explain a recursive algorithm to determine the cohomology of moduli spaces of Higgs bundles on any given curve (in the coprime situation). As an application of the method we compute…
In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal…