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

We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that…

The study of topological quantum field theories increasingly relies upon concepts from higher-dimensional algebra such as n-categories and n-vector spaces. We review progress towards a definition of n-category suited for this purpose, and…

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

Opetopes are algebraic descriptions of shapes corresponding to compositions in higher dimensions. As such, they offer an approach to higher-dimensional algebraic structures, and in particular, to the definition of weak $\omega$-categories,…

Starting from a semiclassical quantization condition based on the trace formula, we derive a periodic-orbit formula for the distribution of spacings of eigenvalues with k intermediate levels. Numerical tests verify the validity of this…

In this paper we define and study for a finite partially ordered set P a class of simplicial complexes on the set P_r of r-element multichains from P. The simplicial complexes depend on a strictly monotone function from [r] to [2r]. We show…

A central question in dynamics is whether the topology of a system determines its geometry. This is known as rigidity. Under mild topological conditions rigidity holds for many classical cases, including: Kleinian groups, circle…

The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…

We examine the topology of the clique complexes of the graphs of weakly and strongly separated subsets of the set $[n]=\{1,2,...,n\}$, which, after deleting all cone points, we denote by $\hat{\Delta}_{ws}(n)$ and $\hat{\Delta}_{ss}(n)$,…

Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

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…

We construct a discrete model of the homotopy theory of $S^1$-spaces. We define a category $\sP$ with objects composed of a simplicial set and a cyclic set along with suitable compatibility data. $\sP$ inherits a model structure from the…

A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…

Point sets of number-theoretic origin, such as the visible lattice points or the $k$-th power free integers, have interesting geometric and spectral properties and give rise to topological dynamical systems that belong to a large class of…