Related papers: Multisorted Boolean Clones Determined by Binary Re…
A matching on a set $X$ is a collection of pairwise disjoint subsets of $X$ of size two. Using computers, we analyze the integral homology of the matching complex $M_n$, which is the simplicial complex of matchings on the set $\{1, >...,…
The homology cobordism group of homology cylinders is a generalization of both the mapping class group of surfaces and the string link concordance group. We consider extensions of Johnson homomorphisms of a mapping class group, Milnor…
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique…
We define a class of invariants, which we call homological invariants, for persistence modules over a finite poset. Informally, a homological invariant is one that respects some homological data and takes values in the free abelian group…
Multiparameter persistence is a natural extension of the well-known persistent homology, which has attracted a lot of interest. However, there are major theoretical obstacles preventing the full development of this promising theory. In this…
Partial orders and directed acyclic graphs are commonly recurring data structures that arise naturally in numerous domains and applications and are used to represent ordered relations between entities in the domains. Examples are task…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
A homogeneous family of subsets over a given set is one with a very ``rich'' automorphism group. We prove the existence of a bi-universal element in the class of homogeneous families over a given infinite set and give an explicit…
Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…
We present a novel approach for finding and evaluating structural models of small metallic nanoparticles. Rather than fitting a single model with many degrees of freedom, the approach algorithmically builds libraries of nanoparticle…
We show that for an infinite set X, if L is a completely distributive algebraic lattice with not more completely join irreducible elements than the size of the power set of X, then there is a monoidal interval in the clone lattice on X…
The $2M$-boson representations of KP hierarchy are constructed in terms of $M$ mutually independent two-boson KP representations for arbitrary number $M$. Our construction establishes the multi-boson representations of KP hierarchy as…
For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…
We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of…
In this paper we develope a categorical theory of relations and use this formulation to define the notion of quantization for relations. Categories of relations are defined in the context of symmetric monoidal categories. They are shown to…
An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m,n)-graph H is a vertex mapping that preserves adjacency,…
We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…
Let rho and sigma be two central relations on a finite set A. It is known that the clones Pol(rho) and Pol(sigma) which consists of all operations on A that preserve rho respectively sigma are among the maximal clones on A. In this paper,…
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…
Universal algebra and clone theory have proven to be a useful tool in the study of constraint satisfaction problems since the complexity, up to logspace reductions, is determined by the set of polymorphisms of the constraint language. For…