scholarly journals Graph polynomials and symmetries

2019 ◽  
Vol 18 (09) ◽  
pp. 1950172 ◽  
Author(s):  
Nafaa Chbili
Keyword(s):  
Automorphism Group ◽  
Finite Field ◽  
Characteristic Polynomial ◽  
Prime Order ◽  
Tutte Polynomial ◽  
Quotient Graph ◽  
Graph Polynomials ◽  
Tutte Polynomials

In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of this paper is to extend this study to other graph polynomials. In particular, we prove that if a graph [Formula: see text] has a symmetry of prime order [Formula: see text], then its characteristic polynomial, with coefficients in the finite field [Formula: see text], is determined by the characteristic polynomial of its quotient graph [Formula: see text]. Similar results are also proved for some generalization of the Tutte polynomial.

scholarly journals Zonotopes, toric arrangements, and generalized Tutte polynomials

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Luca Moci
Keyword(s):  
Characteristic Polynomial ◽  
Hilbert Series ◽  
Hyperplane Arrangement ◽  
Tutte Polynomial ◽  
Integral Points ◽  
Poincaré Polynomial ◽  
Tutte Polynomials ◽  
International Audience ◽  
Toric Arrangement ◽  
Positive Coefficients

International audience We introduce a multiplicity Tutte polynomial $M(x,y)$, which generalizes the ordinary one and has applications to zonotopes and toric arrangements. We prove that $M(x,y)$ satisfies a deletion-restriction recurrence and has positive coefficients. The characteristic polynomial and the Poincaré polynomial of a toric arrangement are shown to be specializations of the associated polynomial $M(x,y)$, likewise the corresponding polynomials for a hyperplane arrangement are specializations of the ordinary Tutte polynomial. Furthermore, $M(1,y)$ is the Hilbert series of the related discrete Dahmen-Micchelli space, while $M(x,1)$ computes the volume and the number of integral points of the associated zonotope. On introduit un polynôme de Tutte avec multiplicité $M(x, y)$, qui généralise le polynôme de Tutte ordinaire et a des applications aux zonotopes et aux arrangements toriques. Nous prouvons que $M(x, y)$ satisfait une récurrence de "deletion-restriction'' et a des coefficients positifs. Le polynôme caractéristique et le polynôme de Poincaré d'un arrangement torique sont des spécialisations du polynôme associé $M(x, y)$, de même que les polynômes correspondants pour un arrangement d'hyperplans sont des spécialisations du polynôme de Tutte ordinaire. En outre, $M(1, y)$ est la série de Hilbert de l'espace discret de Dahmen-Micchelli associé, et $M(x, 1)$ calcule le volume et le nombre de points entiers du zonotope associé.

Tutte Polynomials of Perfect Matroid Designs

2000 ◽  
Vol 9 (4) ◽  
pp. 363-367 ◽  
Author(s):  
EUNICE GOGO MPHAKO
Keyword(s):  
Finite Field ◽  
General Expression ◽  
Tutte Polynomial ◽  
Tutte Polynomials ◽  
Affine Geometries ◽  
Explicit Expressions

This paper gives a general expression for the Tutte polynomial of perfect matroid designs, that is, for matroids in which all ats of the same rank are equicardinal. In particular, explicit expressions are given for the Tutte polynomial of projective and affine geometries over a finite field.

The Tutte polynomial of ideal arrangements

2020 ◽  
Vol 12 (02) ◽  
pp. 2050017
Author(s):  
Hery Randriamaro
Keyword(s):  
Finite Field ◽  
Hyperplane Arrangement ◽  
Dual Graph ◽  
Tutte Polynomial ◽  
Root Systems ◽  
Field Method ◽  
Hyperplane Arrangements ◽  
Acyclic Orientations ◽  
The Matrix ◽  
Tutte Polynomials

The Tutte polynomial was originally a bivariate polynomial enumerating the colorings of a graph and of its dual graph. But it reveals more of the internal structure of the graph like its number of forests, of spanning subgraphs, and of acyclic orientations. In 2007, Ardila extended the notion of Tutte polynomial to hyperplane arrangements, and computed the Tutte polynomials of the classical root systems for certain prime powers of the first variable at the same time. In this paper, we compute the Tutte polynomial of ideal arrangements. These arrangements were introduced in 2006 by Sommers and Tymoczko, and are defined for ideals of root systems. For the ideals of classical root systems, we bring a slight improvement of the finite field method by showing that it can applied on any finite field whose cardinality is not a minor of the matrix associated to the studied hyperplane arrangement. Computing the minor set associated to an ideal of classical root systems particularly permits us to deduce the Tutte polynomials of the classical root systems. For the ideals of the exceptional root systems of type [Formula: see text], [Formula: see text], and [Formula: see text], we use the formula of Crapo.

A NOTE ON THE TUTTE POLYNOMIAL AND THE AUTOMORPHISM GROUP OF A GRAPH

2014 ◽  
Vol 07 (01) ◽  
pp. 1450001 ◽  
Author(s):  
Nafaa Chbili
Keyword(s):  
Automorphism Group ◽  
Short Note ◽  
Tutte Polynomial ◽  
Necessary Condition ◽  
Graph Polynomials

A graph G is said to be p-periodic if the automorphism group Aut(G) contains an element of order p which preserves no edges. In this short note, we investigate the behavior of graph polynomials (Negami and Tutte) with respect to graph periodicity. In particular, we prove that if p is a prime, then the coefficients of the Tutte polynomial of such a graph satisfy a certain necessary condition.

scholarly journals The Characteristic Polynomials of Symmetric Graphs

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 582
Author(s):  
Nafaa Chbili ◽  
Shamma Al Dhaheri ◽  
Mei Tahnon ◽  
Amna Abunamous
Keyword(s):  
Automorphism Group ◽  
Finite Field ◽  
Characteristic Polynomial ◽  
Laplacian Matrix ◽  
Finite Graph ◽  
Characteristic Polynomials ◽  
Induced Subgraph ◽  
P Elements ◽  
Fixed Set ◽  
Algebraic Invariants

In this paper, we study the way the symmetries of a given graph are reflected in its characteristic polynomials. Our aim is not only to find obstructions for graph symmetries in terms of its polynomials but also to measure how faithful these algebraic invariants are with respect to symmetry. Let p be an odd prime and Γ be a finite graph whose automorphism group contains an element h of order p. Assume that the finite cyclic group generated by h acts semi-freely on the set of vertices of Γ with fixed set F. We prove that the characteristic polynomial of Γ , with coefficients in the finite field of p elements, is the product of the characteristic polynomial of the induced subgraph Γ [ F ] by one of Γ \ F . A similar congruence holds for the characteristic polynomial of the Laplacian matrix of Γ .

Types of embedded graphs and their Tutte polynomials

2019 ◽  
Vol 169 (2) ◽  
pp. 255-297 ◽  
Author(s):  
STEPHEN HUGGETT ◽  
IAIN MOFFATT
Keyword(s):  
Systematic Approach ◽  
Tutte Polynomial ◽  
Embedded Graphs ◽  
Graph Polynomials ◽  
Ribbon Graphs ◽  
Duality Relations ◽  
Graphs On Surfaces ◽  
Tutte Polynomials

AbstractWe take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs on surfaces. We give a description of each class in terms of coloured ribbon graphs. We then identify a universal deletion-contraction invariant (i.e., a ‘Tutte polynomial’) for each class. We relate these to graph polynomials in the literature, including the Bollobás–Riordan, Krushkal and Las Vergnas polynomials, and give state-sum formulations, duality relations, deleton-contraction relations, and quasi-tree expansions for each of them.

scholarly journals The Tutte polynomial of symmetric hyperplane arrangements

2020 ◽  
Vol 29 (03) ◽  
pp. 2050004
Author(s):  
Hery Randriamaro
Keyword(s):  
Hyperplane Arrangement ◽  
Dual Graph ◽  
Tutte Polynomial ◽  
Hyperplane Arrangements ◽  
Weyl Groups ◽  
Reflection Groups ◽  
Tutte Polynomials ◽  
One Year ◽  
The One ◽  
Definition Of

The Tutte polynomial is originally a bivariate polynomial which enumerates the colorings of a graph and of its dual graph. Ardila extended in 2007 the definition of the Tutte polynomial on the real hyperplane arrangements. He particularly computed the Tutte polynomials of the hyperplane arrangements associated to the classical Weyl groups. Those associated to the exceptional Weyl groups were computed by De Concini and Procesi one year later. This paper has two objectives: On the one side, we extend the Tutte polynomial computing to the complex hyperplane arrangements. On the other side, we introduce a wider class of hyperplane arrangements which is that of the symmetric hyperplane arrangements. Computing the Tutte polynomial of a symmetric hyperplane arrangement permits us to deduce the Tutte polynomials of some hyperplane arrangements, particularly of those associated to the imprimitive reflection groups.

scholarly journals On algebraic closure in pseudofinite fields

2012 ◽  
Vol 77 (4) ◽  
pp. 1057-1066 ◽  
Author(s):  
Özlem Beyarslan ◽  
Ehud Hrushovski
Keyword(s):  
Automorphism Group ◽  
Finite Field ◽  
Algebraic Closure ◽  
Roots Of Unity ◽  
Prime Field ◽  
Almost All ◽  
Pseudofinite Fields

AbstractWe study the automorphism group of the algebraic closure of a substructureAof a pseudo-finite fieldF. We show that the behavior of this group, even whenAis large, depends essentially on the roots of unity inF. For almost all completions of the theory of pseudofinite fields, we show that overA, algebraic closure agrees with definable closure, as soon asAcontains the relative algebraic closure of the prime field.

scholarly journals A study about the Tutte polynomials of benzenoid chains

2017 ◽  
Vol 5 (1) ◽  
pp. 28-32
Author(s):  
Abdulgani Sahin
Keyword(s):  
Tutte Polynomial ◽  
Signed Graphs ◽  
Tutte Polynomials

Abstract The Tutte polynomials for signed graphs were introduced by Kauffman. In 2012, Fath-Tabar, Gholam-Rezaeı and Ashrafı presented a formula for computing Tutte polynomial of a benzenoid chain. From this point on, we have also calculated the Tutte polynomials of signed graphs of benzenoid chains in this study.

scholarly journals Dichromatic polynomial for graph of a (2,n)-torus knot

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Abdulgani Şahin
Keyword(s):  
Tutte Polynomial ◽  
Signed Graph ◽  
Torus Knots ◽  
Torus Knot ◽  
Tutte Polynomials ◽  
The Relationship ◽  
Dichromatic Polynomial

AbstractIn this study, we introduce the relationship between the Tutte polynomials and dichromatic polynomials of (2,n)-torus knots. For this aim, firstly we obtain the signed graph of a (2,n)-torus knot, marked with {+} signs, via the regular diagram of its. Whereupon, we compute the Tutte polynomial for this graph and find a generalization through these calculations. Finally we obtain dichromatic polynomial lying under the unmarked states of the signed graph of the (2,n)-torus knots by the generalization.

Sign in / Sign up

Export Citation Format

Share Document