相关论文: Normal Order: Combinatorial Graphs
Nonanticommutativity in an open super string moving in the presence of a background antisymmetric tensor field $\mathcal{B}_{\mu \nu}$ is investigated in a conformal field theoretic approach, leading to nonanticommutative structures. In…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from related data…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
Motivated by studies of oscillator networks, we study the spectrum of the join of several normal matrices with constant row sums. We apply our results to compute the characteristic polynomial of the join of several regular graphs. We then…
The power-law behavior is ubiquitous in a majority of real-world networks, and it was shown to have a strong effect on various combinatorial, structural, and dynamical properties of graphs. For example, it has been shown that in real-life…
Operators, refered to as k-fermion operators, that interpolate between boson and fermion operators are introduced through the consideration of two noncommuting quon algebras. The deformation parameters for these quon algebras are roots of…
Combinatorial optimization problems are pervasive across science and industry. Modern deep learning tools are poised to solve these problems at unprecedented scales, but a unifying framework that incorporates insights from statistical…
We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…
We extend the formalism whereby boson mappings can be derived from generalized coherent states to boson-fermion mappings for systems with an odd number of fermions. This is accomplished by constructing supercoherent states in terms of both…
Supersymmetry might be broken, in the real world, by anomalies that affect composite operators, while leaving the action supersymmetric. New constraint equations that govern the composite operators and their anomalies are examined. It is…
We consider a variation of $O(N)$-symmetric vector models in which the vector components are Grassmann numbers. We show that these theories generate the same sort of random polymer models as the $O(N)$ vector models and that they lie in the…
The problem of ranking can be described as follows. We have a set of combinatorial objects $S$, such as, say, the k-subsets of n things, and we can imagine that they have been arranged in some list, say lexicographically, and we want to…
The normal ordering of an integral power of the number operator in terms of boson operators is expressed with the help of the Stirling numbers of the second kind. As a `degenerate version' of this, we consider the normal ordering of a…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
We consider two problems that appear at first sight to be unrelated. The first problem is to count certain diagrams consisting of noncrossing arcs in the plane. The second problem concerns the weak order on the symmetric group. Each…
Several refinements are made in a theory which starts with a Planck-scale statistical picture and ends with supersymmetry and a coupling of fundamental fermions and bosons to SO(N) gauge fields. In particular, more satisfactory treatments…