English
Related papers

Related papers: Ribbon invariants I

200 papers

An $n$-vertex graph whose degree set consists of exactly $n-1$ elements is called antiregular graph. Such type of graphs are usually considered opposite to the regular graphs. An irregularity measure ($IM$) of a connected graph $G$ is a…

Combinatorics · Mathematics 2020-09-08 Akbar Ali , Tamás Réti

The obstruction for application of effective techniques like denominator reduction for the computation of the $c_2$ invariant of Feynman graphs in general is the absence of a 3-valent vertex for the initial steps. In this paper such a…

Algebraic Geometry · Mathematics 2017-04-05 Dmitry Doryn

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…

Combinatorics · Mathematics 2013-05-01 Ye Luo

A minimal homogeneous generating system of the algebra of semi-invariants of tuples of two-by-two matrices over an infinite field of characteristic two or over the ring of integers is given. In an alternative interpretation this yields a…

Commutative Algebra · Mathematics 2020-01-01 M. Domokos

We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…

Combinatorics · Mathematics 2024-03-11 Alain Hertz , Hadrien Mélot , Sébastien Bonte , Gauvain Devillez

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

Combinatorics · Mathematics 2024-07-09 Jesús Arturo Jiménez González , Andrzej Mróz

Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…

Number Theory · Mathematics 2014-05-22 Sung-Hyuk Cha , Edgar G. DuCasse , Louis V. Quintas

At finite $N$ the ring of gauge invariant operators is not freely generated. For problems of interest in physics, these rings are Cohen--Macaulay and admit a Hironaka decomposition, in which the full invariant ring is a free module over a…

High Energy Physics - Theory · Physics 2026-04-20 Robert de Mello Koch , João P. Rodrigues

Author presents a study of certain category of the integrals, which might look quite difficult to compute, but in fact are easily computable, because they do not depend on the parameter in the integrand. As simple and elementary the…

Mathematical Physics · Physics 2012-10-16 Valery Fabrikant

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Symbolic Computation · Computer Science 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

The invariant is one of central topics in science, technology and engineering. The differential invariant is essential in understanding or describing some important phenomena or procedures in mathematics, physics, chemistry, biology or…

Computer Vision and Pattern Recognition · Computer Science 2017-05-26 Erbo Li , Hua Li

For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…

Combinatorics · Mathematics 2017-07-10 C. M. Mynhardt , L. E. Teshima

We consider the problem of undirected graphical model inference. In many applications, instead of perfectly recovering the unknown graph structure, a more realistic goal is to infer some graph invariants (e.g., the maximum degree, the…

Statistics Theory · Mathematics 2017-07-31 Junwei Lu , Matey Neykov , Han Liu

In 2019, investigation of the so-called factor-invariant cubic graphs was initiated by Alspach, Khodadadpour and Kreher. For a cubic graph $\Gamma$ and a vertex-transitive subgroup $G$ of $\mathrm{Aut}(\Gamma)$, a $2$-factor $\mathcal{C}$…

Combinatorics · Mathematics 2026-01-19 Primož Šparl

We provide explicit combinatorial formulas for Ottaviani's degree 15 invariant which detects cubics in 5 variables that are sums of 7 cubes. Our approach is based on the chromatic properties of certain graphs and relies on computer searches…

Algebraic Geometry · Mathematics 2015-05-01 Abdelmalek Abdesselam , Christian Ikenmeyer , Gordon Royle

We study invariant and bi-invariant metrics on groups focusing on finite groups $G$. We show that non-equivalent (bi) invariant metrics on $G$ are in 1-1 correspondence with unitary symmetric (conjugate) partitions on $G$. To every metric…

Combinatorics · Mathematics 2022-01-03 Ricardo A. Podestá , Maximiliano G. Vides

In this paper, we show that for a graph $\Gamma$ from a class named H-rigid graphs, its subgraph ${\rm Int}(\Gamma)$, named the internal graph of $\Gamma$, is an isomorphism invariant of the graph product of hyperfinite II$_1$-factors…

Operator Algebras · Mathematics 2026-03-05 Martijn Caspers , Enli Chen

The Chern topological numbers of a material platform are usually written in terms of the Berry curvature, which depends on the normal modes of the system. Here, we use a gauge invariant Green's function method to determine from first…

Applied Physics · Physics 2020-03-04 Filipa R. Prudêncio , Mário G. Silveirinha

We introduce a $\mathbb{C}/\mathbb{Z}$-valued invariant of a foliated manifold with a stable framing and with a partially flat vector bundle. This invariant can be expressed in terms of integration in differential $K$-theory, or…

K-Theory and Homology · Mathematics 2018-06-25 Ulrich Bunke

A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an upper bound to the number of components that are edges or…

Discrete Mathematics · Computer Science 2012-04-18 Siham Bekkai
‹ Prev 1 4 5 6 7 8 10 Next ›