English
Related papers

Related papers: Tutte Invariants for Alternating Dimaps

200 papers

The $t$-onion star is the digraph obtained from a star with $2t$ leaves by replacing every edge by a triple of arcs, where in $t$ triples we orient two arcs away from the center, and in the remaining $t$ triples we orient two arcs towards…

Combinatorics · Mathematics 2023-10-10 Łukasz Bożyk , Oscar Defrain , Karolina Okrasa , Michał Pilipczuk

Let $\mathcal{A}_0$ and $\mathcal{A}_1$ be two self-adjoint Fredholm Dirac-type operators defined on two non-compact manifolds. If they coincide at infinity so that the relative heat operator is trace-class, one can define their relative…

Differential Geometry · Mathematics 2021-03-01 Pengshuai Shi

Given an $n$-vertex digraph $D$ and a labeling $\sigma:V(D)\to [n]$, we say that an arc $u\to v$ of $D$ is a descent of $\sigma$ if $\sigma(u)>\sigma(v)$. Foata and Zeilberger introduced a generating function $A_D(t)$ for labelings of $D$…

Combinatorics · Mathematics 2023-09-20 Kyle Celano , Nicholas Sieger , Sam Spiro

The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists in reversing the direction of all arcs of $D\langle X\rangle$. The {\it inversion number} of an oriented graph $D$, denoted by ${\rm inv}(D)$, is the minimum number of…

Let $I=[0,1]$ and consider disjoint closed regions $G_{1},....,G_{n}$ in $% I\times I$ and subintervals $I_{1},......,I_{n},$ such that $G_{i}$ projects onto $I_{i.}$ We define the lower and upper maps $\tau_{1},$ $\tau_{2}$ by the lower…

Dynamical Systems · Mathematics 2013-09-25 A. Boyarsky , P. Góra , Zh. Li

Given a time series of graphs G(t) = (V, E(t)), t = 1, 2, ..., where the fixed vertex set V represents "actors" and an edge between vertex u and vertex v at time t (uv \in E(t)) represents the existence of a communications event between…

Machine Learning · Statistics 2015-06-11 Youngser Park , Carey E. Priebe , Abdou Youssef

Trace maps of two-letter substitution rules are investigated with special emphasis on the underlying algebraic structure and on the existence of invariants. We illustrate the results with the generalized Fibonacci chains and show that the…

Mathematical Physics · Physics 2016-09-07 Michael Baake , Uwe Grimm , Dieter Joseph

The study of separating invariants is a recent trend in invariant theory. For a finite group acting linearly on a vector space, a separating set is a set of invariants whose elements separate the orbits of G. In some ways, separating sets…

Commutative Algebra · Mathematics 2014-11-11 Emilie Dufresne , Jack Jeffries

The method of alternating projections involves orthogonally projecting an element of a Hilbert space onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm if the projections are taken…

Functional Analysis · Mathematics 2018-09-18 Omer Ginat

A 4-point Feynman diagram in scalar $\phi^4$ theory is represented by a graph $G$ which is obtained from a connected 4-regular graph by deleting a vertex. The associated Feynman integral gives a quantity called the period of $G$ which is…

Combinatorics · Mathematics 2015-11-30 Iain Crump , Matt DeVos , Karen Yeats

We consider the family of piecewise linear maps $F(x,y)=\left(|x| - y + a, x - |y| + b\right),$ where $(a,b)\in \R^2$. In previous work, we identified a novel phenomenon: certain maps of this class possess one-dimensional invariant sets,…

Dynamical Systems · Mathematics 2026-05-29 Anna Cima , Armengol Gasull , Víctor Mañosa , Francesc Mañosas

On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…

Probability · Mathematics 2026-05-06 Tomas Berggren , Alexei Borodin , Terrence George

The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…

Combinatorics · Mathematics 2012-03-12 Brandon Humpert , Jeremy L. Martin

Using the language of T-varieties, we study torus invariant curves on a complete normal variety $X$ with an effective codimension-one torus action. In the same way that the $T$-invariant Weil divisors on $X$ are sums of "vertical" divisors…

Algebraic Geometry · Mathematics 2013-07-31 Geoffrey Scott

Gessel and Sagan investigated the Tutte polynomial, $T(x,y)$ using depth first search, and applied their techniques to show that the number of acyclic partial orientations of a graph is $2^gT(3,1/2)$. We provide a short deletion-contraction…

Combinatorics · Mathematics 2015-03-20 Spencer Backman

We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system…

Computational Geometry · Computer Science 2023-09-01 Alvin Chiu , David Eppstein , Michael T. Goodrich

For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…

Operator Algebras · Mathematics 2010-03-16 R. D. Burstein

Twisted Alexander invariants have been defined for any knot and linear representation of its group. The invariants are generalized for any periodic representation of the commutator subgroup of the knot group. Properties of the new twisted…

Geometric Topology · Mathematics 2010-12-22 Daniel S. Silver , Susan G. Williams

The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge…

Combinatorics · Mathematics 2020-04-10 Torrie L. Nichols , Alexander Pilz , Csaba D. Tóth , Ahad N. Zehmakan

We present a new edge selection heuristic and vertex ordering heuristic that together enable one to compute the Tutte polynomial of much larger sparse graphs than was previously doable. As a specific example, we are able to compute the…

Discrete Mathematics · Computer Science 2012-09-25 Michael Monagan
‹ Prev 1 8 9 10 Next ›