相关论文: Levels in the toposes of simplicial sets and cubic…

In 2017, Walter Taylor showed that there exist $2$-dimensional simplicial complexes which admit the structure of topological modular lattice but not topological distributive lattice. We give a positive answer to his question as to whether…

The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…

We define a class of sites such that the associated topos is equivalent to the category of smooth sets (representations) of some locally prodiscrete monoids (to be defined). Examples of locally prodiscrete monoids include profinite groups…

Many monoidal-type objects are known to be classified by maps from the Catalan simplicial set $\mathbb{C}$ to various nerves of categories and higher categories. There are, for example, three different nerves of the 2-category of categories…

We introduce the notion of homotopically discrete n-fold category as an n-fold generalization of a groupoid with no non-trivial loops. We give two equivalent descriptions of this structure: in terms of a Segal-type model and in terms of…

We construct new geometric realizations of simplicial and pre-simplicial sets where the standard $n$-simplex, viewed as the space of probability measures on $n+1$ elements, is replaced by the space of $(n+1)$-valued random variables, with…

Working in univalent foundations, we investigate the symmetries of spheres, i.e., the types of the form $\mathbb{S}^n = \mathbb{S}^n$. The case of the circle has a slick answer: the symmetries of the circle form two copies of the circle.…

What makes two computational systems equivalent? Topos theory answers with classifying toposes: a system's semantic content is encoded in the geometric theory it classifies, and two presentations are equivalent when their classifying…

Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…

We propose a recursive definition of V-n-categories and their morphisms. We show that for V k-fold monoidal the structure of a (k-n)-fold monoidal strict (n+1)-category is possessed by V-n-Cat. This article is a completion of the work begun…

We study the link between a compact hypersurface in $\P^{n+1}$ and the set of all its tangent planes. In this context, we identify $\P^{n+1}$ to the set of linear subspaces of codimension one by orthogonal complementarity. This gives rise…

Given a locally presentable category together with a suitable functorial cylinder object, we construct model structures which are sensitive to the `direction' of the cylinder. We show that the Covariant and Contravariant model structures on…

We develop a theory of levels for irreducible representations of symmetric groups of degree $n$ analogous to the theory of levels for finite classical groups. A key property of level is that the level of a character, provided it is not too…

There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…

The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…

Motivated by the direct method in the calculus of variations in $L^{\infty}$, our main result identifies the notion of convexity characterizing the weakly$^*$ lower semicontinuity of nonlocal supremal functionals: Cartesian level convexity.…

The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…

The socle of a graded Buchsbaum module is studied and is related to its local cohomology modules. This algebraic result is then applied to face enumeration of Buchsbaum simplicial complexes and posets. In particular, new necessary…

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…