相关论文: On simplicial and cubical complexes with short lin…

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

For any positive integer $n$, Lov\'{a}sz-Schrijver, Taniyama and Skopenkov provided examples of simplicial $n$-complexes that inevitably contain a nonsplittable two-component link of $n$-spheres, no matter how they are embedded into the…

Properties of two classes of generally convex sets in the n-dimentional real Euclidean space, called m-semiconvex and weakly m-semiconvex, 1<=m<n, are investigated in the present work. In particular, it is established that an open set with…

We consider the braid groups $\mathbf{B}_n(X)$ on finite simplicial complexes $X$, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between…

We classify combinations of isolated singularities that can occur on complex cubic threefolds generalizing analogous results for cubic surfaces due to Schl\"{a}fli and Bruce--Wall. In addition, we provide concise combinatorial description…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

This note informally describes a way to build certain cubical n-categories by iterating a process of taking models of certain finite limits theories. We base this discussion on a construction of "double bicategories" as bicategories…

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…

A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the…

This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…

In this paper we provide an alternative characterization of finite simply connected quandles involving only cocycles with values in abelian groups of prime size. As a corollary of such a characterization and the classification of connected…

We define a complex connection on a real hypersurface of $\C^{n+1}$ which is naturally inherited from the ambient space. Using a system of Codazzi-type equations, we classify connected real hypersurfaces in $\C^{n+1}$, $n\ge 2$, which are…

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

The essential subtoposes of a fixed topos form a complete lattice, which gives rise to the notion of a level in a topos. In the familiar example of simplicial sets, levels coincide with dimensions and give rise to the usual notions of…

The multiplicity conjecture of Herzog, Huneke, and Srinivasan is verified for the face rings of the following classes of simplicial complexes: matroid complexes, complexes of dimension one and two, and Gorenstein complexes of dimension at…

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…