Related papers: Hirsch polytopes with exponentially long combinato…
We prove bounds on intersections of algebraic varieties in $\mathbb{C}^4$ with Cartesian products of finite sets from $\mathbb{C}^2$, and we point out connections with several classic theorems from combinatorial geometry. Consider an…
We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
In this note we asymptotically determine the maximum number of hyperedges possible in an $r$-uniform, connected $n$-vertex hypergraph without a Berge path of length $k$, as $n$ and $k$ tend to infinity. We show that, unlike in the graph…
Let $R$ be a Noetherian commutative ring of positive dimension. The Hochster-Huneke graph of $R$ (sometimes called the dual graph of Spec $R$ and denoted by $\mathcal{G} (R)$) is defined as follows: the vertices are the minimal prime ideals…
We consider the moduli space of bordered Riemann surfaces with boundary and marked points. Such spaces appear in open-closed string theory, particularly with respect to holomorphic curves with Lagrangian submanifolds. We consider a…
We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs; in particular we draw heavily from the topic of dominating sets. Through…
The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
We consider the computational problem of finding short paths in the skeleton of the perfect matching polytope of a bipartite graph. We prove that unless $P=NP$, there is no polynomial-time algorithm that computes a path of constant length…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…
A topological version of a longstanding conjecture of H. Hopf, originally proposed by W. Thurston, states that the sign of the Euler characteristic of a closed aspherical manifold of dimension $d=2m$ depends only on the parity of $m$.…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of the Hamming and the rank metric, and most of the available…
The coefficients of the local $h$-polynomial of the barycentric subdivision of the simplex with $n$ vertices are known to count derangements in the symmetric group $\mathfrak{S}_n$ by the number of excedances. A generalization of this…
In this paper, we study the local connectivity and Hausdorff dimension for the boundaries of the bounded hyperbolic components in the space $\mathcal P_d$ of polynomials of degree $d\geq 3$. It is shown that for any non disjoint-type…
This is a review article on the combinatorial aspects of the mixed Hodge structure of a Milnor fibre of the isolated hypersurface singularity. We give a purely combinatorial method to compute spectral pairs of the singularity under the…
Motivated by the study of a variant of sunflowers, Alon and Holzman recently introduced focal-free hypergraphs. In this paper, we show that there is an interesting connection between the maximum size of focal-free hypergraphs and the…
Recent advances in our understanding of higher derived limits carry multiple implications in the fields of condensed and pyknotic mathematics, as well as for the study of strong homology. These implications are thematically diverse,…