Related papers: A Characterization of Combined Traces Using Labele…
We generalize the problem of reconstructing strings from their substring compositions first introduced by Acharya et al. in 2015 motivated by polymer-based advanced data storage systems utilizing mass spectrometry. Namely, we see strings as…
Higher-order connectivity patterns such as small induced sub-graphs called graphlets (network motifs) are vital to understand the important components (modules/functional units) governing the configuration and behavior of complex networks.…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Most existing popular methods for learning graph embedding only consider fixed-order global structural features and lack structures hierarchical representation. To address this weakness, we propose a novel graph embedding algorithm named…
In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
We define the notions of trace, determinant and, more generally, Berezinian of matrices over a (Z_2)^n graded commutative associative algebra. The applications include a new approach to the classical theory of matrices with coefficients in…
We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova.
A modified trace for a finite k-linear pivotal category is a family of linear forms on endomorphism spaces of projective objects which has cyclicity and so-called partial trace properties. We show that a non-degenerate modified trace…
Recently Galashin, Grinberg, and Liu introduced the refined dual stable Grothendieck polynomials, which are symmetric functions in $x=(x_1,x_2,\dots)$ with additional parameters $t=(t_1,t_2,\dots)$. The refined dual stable Grothendieck…
We propose a categorification of the Chern character that refines earlier work of To\"en and Vezzosi and of Ganter and Kapranov. If X is an algebraic stack, our categorified Chern character is a symmetric monoidal functor from a category of…
We develop the theory of linear algebra over a (Z_2)^n-commutative algebra (n in N), which includes the well-known super linear algebra as a special case (n=1). Examples of such graded-commutative algebras are the Clifford algebras, in…
In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion relation to produce hierarchical structure of sets and…
The trace or the $0$th Hochschild--Mitchell homology of a linear category $\mathcal{C}$ may be regarded as a kind of decategorification of $\mathcal{C}$. We compute traces of the two versions $\dot{\mathcal{U}}$ and $\dot{\mathcal{U}}^*$ of…
An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called stacks, or non-nesting edges, called queues. The stack (queue)…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…
Exceptional sequences are certain ordered sequences of quiver representations. We introduce a class of objects called strand diagrams and use this model to classify exceptional sequences of representations of a quiver whose underlying graph…
The combinatorial approach to knot theory treats knots as diagrams modulo Reidemeister moves. Many constructions of knot invariants (e.g., index polynomials, quandle colorings, etc.) use elements of diagrams such as arcs and crossings by…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
We introduce a theory of stratifications of noncommutative stacks (i.e. presentable stable $\infty$-categories), and we prove a reconstruction theorem that expresses them in terms of their strata and gluing data. This reconstruction theorem…