Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Combinatorial models of creation-annihilation
P Blasiak, P Flajolet - arxiv preprint arxiv:1010.0354, 2010 - arxiv.org
Quantum physics has revealed many interesting formal properties associated with the
algebra of two operators, A and B, satisfying the partial commutation relation AB-BA= 1. This …
algebra of two operators, A and B, satisfying the partial commutation relation AB-BA= 1. This …
[PDF][PDF] Recent developments in combinatorial aspects of normal ordering
M Schork - Enumer. Combin. Appl, 2021 - researchgate.net
In this paper, we report on recent progress concerning combinatorial aspects of normal
ordering. After giving a short introduction to the history and motivation of normal ordering, we …
ordering. After giving a short introduction to the history and motivation of normal ordering, we …
Rule algebras for adhesive categories
N Behr, P Sobocinski - Logical Methods in Computer Science, 2020 - lmcs.episciences.org
We demonstrate that the most well-known approach to rewriting graphical structures, the
Double-Pushout (DPO) approach, possesses a notion of sequential compositions of rules …
Double-Pushout (DPO) approach, possesses a notion of sequential compositions of rules …
Stochastic mechanics of graph rewriting
We propose an algebraic approach to stochastic graph-rewriting which extends the classical
construction of the Heisenberg-Weyl algebra and its canonical representation on the Fock …
construction of the Heisenberg-Weyl algebra and its canonical representation on the Fock …
Sesqui-pushout rewriting: concurrency, associativity and rule algebra framework
N Behr - arxiv preprint arxiv:1904.08357, 2019 - arxiv.org
Sesqui-pushout (SqPO) rewriting is a variant of transformations of graph-like and other types
of structures that fit into the framework of adhesive categories where deletion in unknown …
of structures that fit into the framework of adhesive categories where deletion in unknown …
Combinatorial conversion and moment bisimulation for stochastic rewriting systems
We develop a novel method to analyze the dynamics of stochastic rewriting systems
evolving over finitary adhesive, extensive categories. Our formalism is based on the so …
evolving over finitary adhesive, extensive categories. Our formalism is based on the so …
Recipe theorem for the Tutte polynomial for matroids, renormalization group-like approach
GHE Duchamp, N Hoang-Nghia, T Krajewski… - Advances in Applied …, 2013 - Elsevier
Using a quantum field theory renormalization group-like differential equation, we give a new
proof of the recipe theorem for the Tutte polynomial for matroids. The solution of such an …
proof of the recipe theorem for the Tutte polynomial for matroids. The solution of such an …
Combinatorics of chemical reaction systems
We propose a concise stochastic mechanics framework for chemical reaction systems that
allows to formulate evolution equations for three general types of data: the probability …
allows to formulate evolution equations for three general types of data: the probability …
The algebras of graph rewriting
The concept of diagrammatic combinatorial Hopf algebras in the form introduced for
describing the Heisenberg-Weyl algebra in~\cite {blasiak2010combinatorial} is extended to …
describing the Heisenberg-Weyl algebra in~\cite {blasiak2010combinatorial} is extended to …
Monomial identities in the Weyl algebra
Motivated by a question and some enumerative conjectures of Richard Stanley, we explore
the equivalence classes of words in the Weyl algebra, $\mathbf {k}\left< D, U\mid DU-UD …
the equivalence classes of words in the Weyl algebra, $\mathbf {k}\left< D, U\mid DU-UD …