Related papers: Minors for alternating dimaps
We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivot operations are equivalent iff they contain the…
The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…
We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each…
Let $A$ be a finite commutative ring with unity $1 \neq 0.$ An ideal of $A$ is said to be essential if it has a non-zero intersection with every non-zero ideal of $A.$ The essential graph of $A$ is a simple undirected graph whose vertex set…
In the simple case of a Bernoulli shift on two symbols, zero and one, by permuting the symbols, it is obvious that any two equal entropy shifts are isomorphic. We show that the isomorphism can be realized by a factor that maps a binary…
By generalizing the notion of linearization, a concept originally arising from microlocal analysis and symbolic calculus, to diffeological spaces, we make a first proposal setting for optimization problems in this category. We show how…
In this paper we present a symmetry of a toroidally compactified type II string theory. This symmetry has the interpretaion that it interchanges the left and the right-moving worldsheet coordinates and reverses the orientations of some of…
The Graph Minor Theorem of Robertson and Seymour implies a finite set of obstructions for any minor closed graph property. We show that there are only three obstructions to knotless embedding of size 23, which is far fewer than the 92 of…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…
We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…
In this article we develop the theory of minors of non-commutative schemes. This study is motivated by applications in the theory of non-commutative resolutions of singularities of commutative schemes. In particular, we construct a…
We construct six unitary trace invariants for 2 by 2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We prove two quaternionic versions of a well known…
We use minimal area metrics to generate all nonorientable string diagrams. The surfaces in unoriented string theory have nontrivial open curves and nontrivial closed curves whose neighborhoods are either annuli or Mobius strips. We define a…
We exhibit a connection between two constructions of twisted modules for a general vertex operator algebra with respect to inner automorphisms. We also study pseudo-derivations, pseudo-endomorphisms, and twist deformations of ordinary…
We present a category theoretical generalization of the Goussarov theorem for finite type invariants, relating generating sets for generalized finite type theories with diagrams systems for the corresponding topological objects. We will…
The linear transports along paths in vector bundles introduced in Ref. [1] are applied to the special case of tensor bundles over a given differentiable manifold. Links with the transports along paths generated by derivations of tensor…
The structure of type A and B trace anomalies is reanalyzed in terms of the universal behaviour of dimension -2 invariant amplitudes. Based on it a general argument for trace anomaly matching between the unbroken and broken phases of a CFT…
In this lecture we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. Our analysis is based on an approach to modular invariants using braided sector induction…
We provide a matrix-based formula for the Tutte symmetric function of a graph. In particular, for any graph $G$ with a designated head and tail vertex, we describe an infinite matrix $M_G$ from which the Tutte symmetric function can be…
We describe a combinatorial approach to the analysis of the shape and orientation dependence of Wilson loop observables on two-dimensional noncommutative tori. Morita equivalence is used to map the computation of loop correlators onto the…