Related papers: D\'ecomposition monomorphe des structures relation…
We construct 2D and 3D finite element de Rham sequences of arbitrary polynomial degrees with extra smoothness. Some of these elements have nodal degrees of freedom (DoFs) and can be considered as generalisations of scalar Hermite and…
We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
Let R be a locally finitely generated algebra over a discrete valuation ring V of mixed characteristic. For any of the homological properties, the Direct Summand Theorem, the Monomial Theorem, the Improved New Intersection Theorem, the…
If $H$ is a monoid and $a=u_1 \cdots u_k \in H$ with atoms (irreducible elements) $u_1, \ldots, u_k$, then $k$ is a length of $a$, the set of lengths of $a$ is denoted by $\mathsf L(a)$, and $\mathcal L(H)=\{\,\mathsf L (a) \mid a \in H…
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The complete Prolog code is available at…
Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps that preserve feasibility of the intermediate solutions. In…
We investigate the automorphism group of the substructure ordering of finite directed graphs. The second author conjectured that it is isomorphic to the 768-element group $(\mathbb{Z}_2^4 \times S_4)\rtimes_{\alpha} \mathbb{Z}_2$. Though…
We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees…
This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…
A hereditary property of combinatorial structures is a collection of structures (e.g. graphs, posets) which is closed under isomorphism, closed under taking induced substructures (e.g. induced subgraphs), and contains arbitrarily large…
In this paper, we classify finite categories with two objects such that one of the endomorphism monoids is a group. We prove that having a group on one side affects the structure of the other endomorphism monoid, and we prove that it is…
In this paper, we explore the structure of $\mathbb{Z}/ m\mathbb{Z}$ in terms of its orbits under modular exponentiation, illustrating this with a sequential power graph that is naturally derived from the orbits by connecting elements of…
We introduce a new perspective on a procedure for generating pseudo-Anosov homemorphisms from postcritically finite interval maps. The central idea is the realization of a tree structure on one such family of pseudo-Anosovs: individual…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
This work continues the study of the properties of finitely constrained groups of binary tree automorphisms in terms of their Hausdorff dimension. We prove that there are exactly $2^{2d-3}$ finitely constrained groups of binary tree…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
In this paper, we show that two constructions form stacks: Firstly, as one varies the $\infty$-topos, $\mathcal{X}$, Lurie's homotopy theory of higher categories internal to $\mathcal{X}$ varies in such a way as to form a stack over the…