相关论文: A new labeling construction from the $\otimes_h$-p…

Let A be a Hopf algebra and H a coalgebra. We shall describe and classify up to an isomorphism all Hopf algebras E that factorize through A and H: that is E is a Hopf algebra such that A is a Hopf subalgebra of E, H is a subcoalgebra in E…

We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for allowing local structures in the conditional probability distribution of a node, such…

String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…

The individualization-refinement paradigm for computing a canonical labeling and the automorphism group of a graph is investigated. A new algorithmic design aimed at reducing the size of the associated search space is introduced, and a new…

A general overview of the existing difference ring theory for symbolic summation is given. Special emphasis is put on the user interface: the translation and back translation of the corresponding representations within the term algebra and…

A category N of labeled (oriented) trivalent graphs (nets) or ribbon graphs is extended by new generators called fusing, braiding, twist and switch with relations which can be called Moore--Seiberg relations. A functor to N is constructed…

A key challenge when trying to understand innovation is that it is a dynamic, ongoing process, which can be highly contingent on ephemeral factors such as culture, economics, or luck. This means that any analysis of the real-world process…

We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…

Many related products and coproducts (e.g. Hadamard, Cauchy, Kronecker, induction, internal, external, Solomon, composition, Malvenuto-Reutenauer, convolution, etc.) have been defined in the following objects : species, representations of…

We give a new combinatorial explanation for well-known relations between determinants and traces of matrix powers. Such relations can be used to obtain polynomial-time and poly-logarithmic space algorithms for the determinant. Our new…

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…

A surprising diversity of different products of hypergraphs have been discussed in the literature. Most of the hypergraph products can be viewed as generalizations of one of the four standard graph products. The most widely studied variant,…

Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…

A new condition, the strong inner product property, is introduced and used to construct sign patterns of row orthogonal matrices. Using this property, infinite families of sign patterns allowing row orthogonality are found. These provide…

The crossed product, and consequent transition from von Neumann algebras of type III to II, is recovered from a truncation of more general gravitational dressing constructions, about certain spacetimes. This is done by extending "standard…

Recently, Bapat and Kurata [\textit{Linear Algebra Appl.}, 562(2019), 135-153] defined the Cartesian product of two square matrices $A$ and $B$ as $A\oslash B=A\otimes \J+\J\otimes B$, where $\J$ is the all one matrix of appropriate order…

We construct two new classes of topological dynamical systems; one is a factor of a one-sided shift of finite type while the second is a factor of the two-sided shift. The data is a finite graph which presents the shift of finite type, a…

In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…

Given the real Clifford algebra of a quadratic space with a given signature, we define a new product in this structure such that it simulates the Clifford product of a quadratic space with another signature different from the original one.…

One of the most difficult aspects of modeling complex dilemmas in decision-analytic terms is composing a diagram of relevance relations from a set of domain concepts. Decision models in domains such as medicine, however, exhibit certain…