27,517 research outputs found
Cycle Bases of Reduced Powers of Graphs
We define what appears to be a new construction. Given a graph G and a positive integer k, the reduced kth power of G, denoted G(k), is the configuration space in which k indistinguishable tokens are placed on the vertices of G, so that any vertex can hold up to k tokens. Two configurations are adjacent if one can be transformed to the other by moving a single token along an edge to an adjacent vertex. We present propositions related to the structural properties of reduced graph powers and, most significantly, provide a construction of minimum cycle bases of G(k).
The minimum cycle basis construction is an interesting combinatorial problem that is also useful in applications involving configuration spaces. For example, if G is the state-transition graph of a Markov chain model of a stochastic automaton, the reduced power G(k) is the state-transition graph for k identical (but not necessarily independent) automata. We show how the minimum cycle basis construction of G(k) may be used to confirm that state-dependent coupling of automata does not violate the principle of microscopic reversibility, as required in physical and chemical applications
Tensor structure from scalar Feynman matroids
We show how to interpret the scalar Feynman integrals which appear when
reducing tensor integrals as scalar Feynman integrals coming from certain nice
matroids.Comment: 12 pages, corrections suggested by referee
Toric ideals associated with gap-free graphs
In this article we prove that every toric ideal associated with a gap-free
graph has a squarefree lexicographic initial ideal. Moreover, in the
particular case when the complementary graph of is chordal (i.e. when the
edge ideal of has a linear resolution), we show that there exists a reduced
Gr\"obner basis of the toric ideal of such that all the
monomials in the support of are squarefree. Finally, we show
(using work by Herzog and Hibi) that if is a monomial ideal generated in
degree 2, then has a linear resolution if and only if all powers of
have linear quotients, thus extending a result by Herzog, Hibi and Zheng.Comment: 13 pages, v2. To appear in Journal of Pure and Applied Algebr
On the max-algebraic core of a nonnegative matrix
The max-algebraic core of a nonnegative matrix is the intersection of column
spans of all max-algebraic matrix powers. Here we investigate the action of a
matrix on its core. Being closely related to ultimate periodicity of matrix
powers, this study leads us to new modifications and geometric
characterizations of robust, orbit periodic and weakly stable matrices.Comment: 27 page
P?=NP as minimization of degree 4 polynomial, integration or Grassmann number problem, and new graph isomorphism problem approaches
While the P vs NP problem is mainly approached form the point of view of
discrete mathematics, this paper proposes reformulations into the field of
abstract algebra, geometry, fourier analysis and of continuous global
optimization - which advanced tools might bring new perspectives and approaches
for this question. The first one is equivalence of satisfaction of 3-SAT
problem with the question of reaching zero of a nonnegative degree 4
multivariate polynomial (sum of squares), what could be tested from the
perspective of algebra by using discriminant. It could be also approached as a
continuous global optimization problem inside , for example in
physical realizations like adiabatic quantum computers. However, the number of
local minima usually grows exponentially. Reducing to degree 2 polynomial plus
constraints of being in , we get geometric formulations as the
question if plane or sphere intersects with . There will be also
presented some non-standard perspectives for the Subset-Sum, like through
convergence of a series, or zeroing of fourier-type integral for some natural . The last discussed
approach is using anti-commuting Grassmann numbers , making nonzero only if has a Hamilton cycle. Hence,
the PNP assumption implies exponential growth of matrix representation of
Grassmann numbers. There will be also discussed a looking promising
algebraic/geometric approach to the graph isomorphism problem -- tested to
successfully distinguish strongly regular graphs with up to 29 vertices.Comment: 19 pages, 8 figure
Recognizing Graph Theoretic Properties with Polynomial Ideals
Many hard combinatorial problems can be modeled by a system of polynomial
equations. N. Alon coined the term polynomial method to describe the use of
nonlinear polynomials when solving combinatorial problems. We continue the
exploration of the polynomial method and show how the algorithmic theory of
polynomial ideals can be used to detect k-colorability, unique Hamiltonicity,
and automorphism rigidity of graphs. Our techniques are diverse and involve
Nullstellensatz certificates, linear algebra over finite fields, Groebner
bases, toric algebra, convex programming, and real algebraic geometry.Comment: 20 pages, 3 figure
- …