Related papers: Finitely presented monoids with linear Dehn functi…
We show that the set of families of smooth well-formed Fano weighted complete intersections admits a natural partition with respect to the variance $\mathrm{var}(X) = \mathrm{coind}(X) - \mathrm{codim}(X)$. Moreover, we obtain the…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets.
In this short note we present a simple combinatorial trick which can be effectively applied to show the non--existence of sharply transitive sets of permutations in certain finite permutation groups.
In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…
We show how decreasing diagrams introduced in the theory of rewriting systems can be used to prove coherence type theorems in category theory. We apply this method to describe a coherent presentation of the $0$-Hecke monoid…
In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be…
We establish rank-finiteness for the class of $G$-crossed braided fusion categories, generalizing the recent result for modular categories and including the important case of braided fusion categories. This necessitates a study of slightly…
This paper studies loss functions for finite sets. For a given finite set $S$, we give sum-of-square type loss functions of minimum degree. When $S$ is the vertex set of a standard simplex, we show such loss functions have no spurious…
We develop a theory of infinity properads enriched in a general symmetric monoidal infinity category. These are defined as presheaves, satisfying a Segal condition and a Rezk completeness condition, over certain categories of graphs. In…
We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…
We prove two results on some special generators of finite simple groups and use them to prove that every non-abelian finite simple group $S$ admits a non-congruence presentation (as conjectured in [CLT24]), and that if $S$ has a non-trivial…
This paper shows how to construct coherent presentations (presentations by generators, relations and relations among relations) of monoids admitting a right-noetherian Garside family. Thereby, it resolves the question of finding a unifying…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…
In a number of papers, Y. Sternfeld investigated the problems of representation of continuous and bounded functions by linear superpositions. In particular, he proved that if such representation holds for continuous functions, then it holds…
In this paper we discuss the change in contact structures as their supporting open book decompositions have their binding components cabled. To facilitate this and applications we define the notion of a rational open book decomposition that…
In this paper, we prove a sufficient and necessary condition for the transition probability distribution of a general, time-inhomogeneous linear SDE to possess a density function and study the differentiability of the density function and…
In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not…
A function between two metric spaces is said to be totally bounded regular if it preserves totally bounded sets. These functions need not be continuous in general. Hence the purpose of this article is to study such functions vis-\'a-vis…