English
Related papers

Related papers: Tutte Invariants for Alternating Dimaps

200 papers

Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…

Chaotic Dynamics · Physics 2010-06-22 A. Gomez , J. D. Meiss

We study aperiodic systems based on substitution rules by means of a transfer-matrix approach. In addition to the well-known trace map, we investigate the so-called `antitrace' map, which is the corresponding map for the difference of the…

Disordered Systems and Neural Networks · Physics 2007-05-23 Xiaoguang Wang , Uwe Grimm , Michael Schreiber

The spectral eta function for certain families of Dirac operators on noncommutative $3$-torus is considered and the regularity at zero is proved. By using variational techniques, we show that $\eta_{D}(0)$ is a conformal invariant. By…

Quantum Algebra · Mathematics 2015-04-07 Ali Fathi , Masoud Khalkhali

We prove the existence of invariant tori to the area-preserving maps defined on $ \mathbb{R}^2\times\mathbb{T} $ \begin{equation*} \bar{x}=F(x,\theta), \qquad \bar{\theta}=\theta+\alpha\, \,(\alpha\in \mathbb{R}\setminus\mathbb{Q}),…

Dynamical Systems · Mathematics 2022-08-23 Hongyu Cheng , Shimin Wang , Fenfen Wang

The group scheme of ternary automorphisms of a perfect finite dimensional evolution algebra A is computed. The main advantage of using group schemes is that it allows to apply the Lie functor to determine the Lie algebra of ternary…

Rings and Algebras · Mathematics 2024-05-17 Candido Martin Gonzalez , Jacques Rabie , Juana Sanchez-Ortega

The theory of monotone operators plays a major role in modern optimization and many areas of nonlinera analysis. The central classes of monotone operators are matrices with a positive semidefinite symmetric part and subsifferential…

Functional Analysis · Mathematics 2024-05-24 Salihah Thabet Alwadani

Graph minors are a primary tool in understanding the structure of undirected graphs, with many conceptual and algorithmic implications. We propose new variants of \emph{directed graph minors} and \emph{directed graph embeddings}, by…

Discrete Mathematics · Computer Science 2019-05-30 Argyrios Deligkas , Reshef Meir

In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…

Combinatorics · Mathematics 2023-10-11 Jozef Kratica , Vera Kovačević-Vujčić , Mirjana Čangalović

A graph operator is a mapping $\phi$ which maps every graph $G$ from some class of graphs to a new graph $\phi(G)$. In this paper, we introduce and study the properties of the mincut operator, specifically the effects of iteration of the…

Combinatorics · Mathematics 2025-01-28 Christo Kriel , Eunice Mphako-Banda

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…

Combinatorics · Mathematics 2008-07-01 Joanna Ellis-Monaghan , Criel Merino

In this paper we consider a special class of polymorphisms with invariant measure, - (cf.[1])- the algebraic polymorphisms of compact groups. A general polymorphism is -- by definition -- a many-valued map with invariant measure, and the…

Dynamical Systems · Mathematics 2007-05-28 Klaus Schmidt , Anatoly Vershik

We present recent results on the enumeration of $q$-coloured planar maps, where each monochromatic edge carries a weight $\nu$. This is equivalent to weighting each map by its Tutte polynomial, or to solving the $q$-state Potts model on…

Combinatorics · Mathematics 2020-04-21 Mireille Bousquet-Mélou

Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…

Combinatorics · Mathematics 2013-05-30 Federico Ardila , Federico Castillo , Michael Henley

In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus on edge-minimal such graphs. A 2T-graph is a graph whose…

Combinatorics · Mathematics 2019-03-26 J. Bang-Jensen , S. Bessy , J. Huang , M. Kriesell

We derive maps relating currents and their divergences in non-abelian U(N) noncommutative gauge theory with the corresponding expressions in the ordinary (commutative) description. For the U(1) theory, in the slowly-varying-field…

High Energy Physics - Theory · Physics 2007-05-23 Rabin Banerjee , Kuldeep Kumar

This study defines finite-type invariants for curves on surfaces and reveals the construction of these finite-type invariants for stable homeomorphism classes of curves on compact oriented surfaces without boundaries. These invariants are a…

Geometric Topology · Mathematics 2008-10-15 Noboru Ito

We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge and taking the partial dual with respect to the edge. These two operations give rise to an action of S_3^{|E(G)|},…

Combinatorics · Mathematics 2012-02-28 Joanna A. Ellis-Monaghan , Iain Moffatt

Well-known operations defined on a non-degenerate inner product vector space are extended to the case of a degenerate inner product. The main obstructions to the extension of these operations to the degenerate case are (1) the index…

Mathematical Physics · Physics 2011-12-30 Ovidiu Cristinel Stoica

We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges.…

Combinatorics · Mathematics 2007-05-23 Amitava Bhattacharya , Uri N. Peled , Murali K. Srinivasan