Related papers: Normal Order: Combinatorial Graphs
For a given Lie superalgebra, two ways of constructing color superalgebras are presented. One of them is based on the color superalgebraic nature of the Clifford algebras. The method is applicable to any Lie superalgebras and results in…
We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their…
A number of problems in theoretical physics share a common nucleus of combinatoric nature. It is argued here that Hopf algebraic concepts and techiques can be particularly efficient in dealing with such problems. As a first example, a brief…
Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose a new graph convolutional neural network model for learning branch-and-bound variable selection policies, which leverages the natural…
Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of the rationals from a dynamical systems point of view, somehow continuing along the path started in [BI]. We obtain in…
In [1] a new bosonization procedure has been illustrated, which allows to express a fermionic gaussian system in terms of commuting variables at the price of introducing an extra dimension. The Fermi-Bose duality principle established in…
In recent years, there has been a growing interest in using learning-based approaches for solving combinatorial problems, either in an end-to-end manner or in conjunction with traditional optimization algorithms. In both scenarios, the…
In this paper, we present a Hopf algebra description of a bosonic quantum model, using the elementary combinatorial elements of Bell and Stirling numbers. Our objective in doing this is as follows. Recent studies have revealed that…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
Many problems in real life can be converted to combinatorial optimization problems (COPs) on graphs, that is to find a best node state configuration or a network structure such that the designed objective function is optimized under some…
BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. In arXiv:1306.3995, Gogolin et al. claimed that even an ideal…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the…
Noncommutativity in an open bosonic string moving in the presence of a background Neveu-Schwarz two-form field $B_{\mu \nu}$ is investigated in a conformal field theory approach, leading to noncommutativity at the boundaries. In contrast to…
We investigate properties of exponential operators preserving the particle number using combinatorial methods developed in order to solve the boson normal ordering problem. In particular, we apply generalized Dobinski relations and methods…
The quon algebra gives a description of particles, ``quons,'' that are neither fermions nor bosons. The parameter $q$ attached to a quon labels a smooth interpolation between bosons, for which $q = +1$, and fermions, for which $q = -1$.…