Related papers: An intrinsically linked simplicial $n$-complex

An abstract simplicial complex is said to be $d$-representable if it records the intersection pattern of a collection of convex sets in $\mathbb{R}^d$. In this paper, we show that $d$-representability of a simplicial complex is equivalent…

Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when…

The present paper finds new necessary and sufficient conditions for $6$-dimensional closed and simply-connected manifolds of certain classes to admit special generic maps into certain Euclidean spaces. The class of special generic maps…

Planar commutative n-complex numbers of the form u=x_0+h_1x_1+h_2x_2+...+h_{n-1}x_{n-1} are introduced in an even number n of dimensions, the variables x_0,...,x_{n-1} being real numbers. The planar n-complex numbers can be described by the…

We consider N-complexes as functors over an appropriate linear category in order to show first that the Krull-Schmidt Theorem holds, then to prove that amplitude cohomology only vanishes on injective functors providing a well defined…

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…

The paper contains an application of van Kampen theorem for groupoids for computation of homotopy types of certain class of non-compact foliated surfaces obtained by gluing at most countably many strips $\mathbb{R}\times(0,1)$ with boundary…

Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…

This is an English translation, prepared by Wilberd van der Kallen, of the 1951 thesis by T.A. Springer. In this thesis Springer studied the classification of conjugacy classes in the symplectic group $Sp_n(K)$, where the commutative field…

A clover is a framed trivalent graph with some additional structure, embedded in a 3-manifold. We define surgery on clovers, generalizing surgery on Y-graphs used earlier by the second author to define a new theory of finite-type invariants…

Bi-Hamiltonian hierarchies of soliton equations are derived from geometric non-stretching (inelastic) curve flows in the Hermitian symmetric spaces $SU(n+1)/U(n)$ and $SO(2n)/U(n)$. The derivation uses Hasimoto variables defined by a moving…

Each acyclic graph, and more generally, each acyclic orientation of the graph associated to a Cartan matrix, allows to define a so-called frise; this is a collection of sequences over the positive natural numbers, one for each vertex of the…

We introduce a spectral notion of graph complexity derived from the Weyl's law. We experimentally demonstrate its correlation to how well the graph can be embedded in a low-dimensional Euclidean space.

The neighborhood complex $N(G)$ is a simplicial complex assigned to a graph $G$ whose connectivity gives a lower bound for the chromatic number of $G$. We show that if the Kronecker double coverings of graphs are isomorphic, then their…

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

The classical Zariski-van Kampen theorem gives a presentation of the fundamental group of the complement of a complex algebraic curve in $\mathbb{P}^2$. The first generalization of this theorem to singular (quasi-projective) varieties was…

In this paper, we introduce the concept of spanning simplicial complexes $\Delta_s(G)$ associated to a simple finite connected graph G. We give the characterization of all spanning trees of the uni-cyclic graph $U_{n,m}$. In particular, we…

We employ projective Fra\"iss\'e theory to define the "generic combinatorial $n$-simplex" as the pro-finite, simplicial complex that is canonically associated with a family of simply defined selection maps between finite triangulations of…