相关论文: On ordered face structures and many-to-one computa…

We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the…

The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…

This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…

We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…

We give details of a formerly known relation between ternary quadratic forms and quaternion orders through the even Clifford algebra. Based on this and classifications of ternary quadratic forms we give a completely explicit classification…

We describe four natural operad structures on the vector space generated by isomorphism classes of finite posets. The three last ones are set-theoretical and can be seen as a simplified version of the first, the same way the NAP operad…

In various subjects including mathematics, one can hope to use mathematical thinking well when the right kinds of algebraic structure to consider can be discovered or spotted. Therefore, it would help to understand kinds of algebraic…

In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…

We describe the modular operad structure on the moduli spaces of pointed stable curves equipped with an admissible $G$-cover. To do this we are forced to introduce the notion of an operad colored not by a set but by the objects of a…

We introduce and study functorial and combinatorial constructions concerning equivariant Burnside groups.

We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…

A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local…

This expository paper explores the interaction of group ordering with topological questions, especially in dimensions 2 and 3. Among the topics considered are surfaces, braid groups, 3-manifolds and their structures such as foliations and…

We introduce ordered and unordered configuration spaces of 'clusters' of points in an Euclidean space $\mathbb{R}^d$, where points in each cluster satisfy a 'verticality' condition, depending on a decomposition $d=p+q$. We compute the…

This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…

In the present paper we introduce a lattice-ordered partial monoid structure on a suitable set of multilayer networks. We first study a kind of mappings that preserve the partial order and describe the order structure. After that we define…

A uniform space is a topological space together with some additional structure which allows one to make sense of uniform properties such as completeness or uniform convergence. Motivated by previous work of J. Rivera-Letelier, we give a new…

The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

We develop a theory of ordered *-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple…