Related papers: Vertex maps between simplices, cubes, and crosspol…
We prove an equivalence of categories from formal complex structures with formal holomorphic maps to homotopy algebras over a simple operad with its associated homotopy morphisms. We extend this equivalence to complex manifolds. A complex…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
The edges of the characteristic imset polytope, $\operatorname{CIM}_p$, were recently shown to have strong connections to causal discovery as many algorithms could be interpreted as greedy restricted edge-walks, even though only a strict…
We describe the homotopy types of Vietoris-Rips complexes of hypercube graphs at scale $3$. We represent the vertices in the hypercube graph $Q_m$ as the collection of all subsets of $[m]=\{1, 2, \ldots, m\}$ and equip $Q_m$ with the metric…
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X. This…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
Given a matching $M$ in the hypercube $Q^n$, the \emph{profile} of $M$ is the vector $\boldsymbol{x}=(x_1,\ldots, x_n) \in \mathbb{N}^n$ such that $M$ contains $x_i$ edges whose endpoints differ in the $i$th coordinate. If $M$ is a perfect…
The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries. Polynomial-time learning algorithms are described for vertex covers, independent…
In this work we define the trajectory coset of an affine map and use it to study the similarity classes of affine maps. We use the trajectory coset, a tool which allows us to gain a deeper understanding of the interplay between geometry…
Convergence spaces are a generalization of topological spaces. The category of convergence spaces is well-suited for Algebraic Topology, one of the reasons is the existence of exponential objects provided by continuous convergence. In this…
We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…
Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…
The aim of this paper is to give a survey of nonassociative Hom-algebra and Hom-superalgebra structures. The main feature of these algebras is that the identities defining the structures are twisted by homomorphisms. We discuss…
In classical homotopy theory, two spaces are homotopy equivalent if one space can be continuously deformed into the other. This theory, however, does not respect the discrete nature of graphs. For this reason, a discrete homotopy theory…
Maps between manifolds $M^m\to N^{m+\ell}$ ($\ell>0$) have multiple points, and more generally, multisingularities. The closure of the set of points where the map has a particular multisingularity is called the multisingularity locus. There…
We study the computational complexity of Feedback Vertex Set on subclasses of Hamiltonian graphs. In particular, we consider Hamiltonian graphs that are regular or are planar and regular. Moreover, we study the less known class of…
The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an…
Stable fold maps are fundamental tools in a generalization of the theory of Morse functions on smooth manifolds and its application to studies of geometric properties of smooth manifolds. Round fold maps were introduced as stable fold maps…
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…
We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercube, the unit ball for the $\infty$-norm, and its dual…