Related papers: Total cut complexes and their duals

For $n\geq 2$ we compute the homotopy groups of $(n-1)$-connected closed manifolds of dimension $(2n+1)$. Away from the finite set of primes dividing the order of the torsion subgroup in homology, the $p$-local homotopy groups of $M$ are…

We discuss the existence of an absolute Chow-Kuenneth decomposition for complete degenerations of families of Abelian threefolds with complex multiplication over a particular Picard Modular Surface studied by Holzapfel. In addition to the…

In the first part of this paper, we survey results that are associated with three types of Laplacian matrices:difference, normalized, and signless. We derive eigenvalue and eigenvector formulaes for paths and cycles using circulant matrices…

Let $R$ be a commutative local ring. We study the subcategory of the homotopy category of $R$-complexes consisting of the totally acyclic $R$-complexes. In particular, in the context where $Q\to R$ is a surjective local ring homomorphism…

We interpret mathematically the pair (master equation, solution of master equation) up to equivalence, as the pair (a presentation of a free triangular dga T over a combination operad O, dga map of T into C, a dga over O) up to homotopy…

This paper studies the problem of counting homomorphisms from a bipartite source graph to a bipartite target graph. An exact formula is first derived for the number of homomorphisms from a complete bipartite graph into a general bipartite…

We provide a diagrammatic computation for the bilinear form, which is defined as the pairing between the (relative) cup products with every local coefficients and every integral homology 2-class of every links in the 3-sphere. As a…

We show that if the cochain complex computing Ext groups (in the category of modules over Hopf algebroids) admits a cocyclic structure, then the noncommutative Cartan calculus structure on Tor over Ext dualises in a cyclic sense to a…

The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…

We investigate the homotopy type of the Alexander dual of a simplicial complex. In general the homotopy type of K does not determine the homotopy type of its dual K*. Moreover, one can construct for each finitely presented group G, a simply…

Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…

The d-Cut problem is to decide if a graph has an edge cut such that each vertex has at most d neighbours at the opposite side of the cut. If $d=1$, we obtain the intensively studied Matching Cut problem. The d-Cut problem has been studied…

It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D=(V,A)$, a cost function $w: A\rightarrow \{0,1\}$ and a natural…

The cut polytope of a graph is an important object in several fields, such as functional analysis, combinatorial optimization, and probability. For example, Sturmfels and Sullivant showed that the toric ideals of cut polytopes are useful in…

For every fixed graph $H$, it is known that homomorphism counts from $H$ and colorful $H$-subgraph counts can be determined in $O(n^{t+1})$ time on $n$-vertex input graphs $G$, where $t$ is the treewidth of $H$. On the other hand, a running…

We investigate complete arcs of degree greater than two, in projective planes over finite fields, arising from the set of rational points of a generalization of the Hermitian curve. The degree of the arcs is closely related to the number of…

A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…

We study $M$-alternating Hamilton paths and $M$-alternating Hamilton cycles in a simple connected graph $G$ on $\nu$ vertices with a perfect matching $M$. Let $G$ be a bipartite graph, we prove that if for any two vertices $x$ and $y$ in…

We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…

Let $X,Y$ be $(n-1)$-connected finite pointed CW-complexes of dimension at most $n+2$, $n\geq 3$. In this paper we give elementary proofs of the abelian group structure of $[X,Y]$ of homotopy classes of based maps from $X$ to $Y$, which was…