English
Related papers

Related papers: Ruling invariants for Legendrian graphs

200 papers

We study the multivariate independence polynomials of graphs and the log-concavity of the coefficients of their univariate restrictions. Let $R_{W_4}$ be the operator defined on simple and undirected graphs which replaces each edge with a…

Combinatorics · Mathematics 2025-04-17 Amire Bendjeddou , Leonard Hardiman

In the special case of graphs G of independence number a(G)=3 without induced chordless cycles C7 it is shown that exists connected dominating set D of vertices with number of vertices n(D)<=4. Using the concept of connected dominating…

Combinatorics · Mathematics 2017-03-21 Vladimir Bercov

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

Representation Theory · Mathematics 2024-11-20 Rebecca Bourn , William Q. Erickson , Jeb F. Willenbring

In this note we define and study graph invariants generalizing to higher dimension the maximum degree of a vertex and the vertex-connectivity (our $0$-dimensional cases). These are known to coincide almost surely in any regime for…

Combinatorics · Mathematics 2019-04-18 Eric Babson , Volkmar Welker

We study the semiclassical limit of a class of invariant tensors for infinite-dimensional unitary representations of $\mathrm{SL}(2,\mathbb{C})$ of the principal series, corresponding to generalized Clebsch-Gordan coefficients with $n\geq3$…

General Relativity and Quantum Cosmology · Physics 2024-02-27 Pietro Dona , Marco Fanizza , Pierre Martin-Dussaud , Simone Speziale

An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for…

Geometric Topology · Mathematics 2019-06-04 Carmen Caprau

In this article we study the differential graded algebra (DGA) invariant associated to Legendrian knots in tight lens spaces. Given a grid number one diagram for a knot in L(p, q), we show how to construct a special Lagrangian diagram…

Geometric Topology · Mathematics 2010-03-22 Joan E. Licata

We use the contact invariant defined in [2] to construct a new invariant of Legendrian knots in Kronheimer and Mrowka's monopole knot homology theory (KHM), following a prescription of Stipsicz and V\'ertesi. Our Legendrian invariant…

Symplectic Geometry · Mathematics 2019-02-12 John A. Baldwin , Steven Sivek

Lagrangian cobordism induces a preorder on the set of Legendrian links in any contact 3-manifold. We show that any finite collection of null-homologous Legendrian links in a tight contact 3-manifold with a common rotation number has an…

Geometric Topology · Mathematics 2024-12-25 Joshua M. Sabloff , David Shea Vela-Vick , C. -M. Michael Wong

We show that multivariable colored link invariants are derived from the roots of unity representations of $U_q(g)$. We propose a property of the Clebsch-Gordan coefficients of $U_q(g)$, which is important for defining the invariants of…

High Energy Physics - Theory · Physics 2008-02-03 Tetsuo Deguchi , Tomotada Ohtsuki

Neural networks that satisfy invariance with respect to input permutations have been widely studied in machine learning literature. However, in many applications, only a subset of all input permutations is of interest. For heterogeneous…

Machine Learning · Computer Science 2023-02-28 Dmitry Rybin , Ruoyu Sun , Zhi-Quan Luo

The $c_2$ invariants in all 4 different representations of the Feynman period (parametric and dual parametric representations, position and momentum spaces) coincide for all log-divergent graphs that satisfy the combinatorial condition…

Algebraic Geometry · Mathematics 2015-10-14 Dmitry Doryn

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

Combinatorics · Mathematics 2026-04-07 Xiangshuai Dong , Tingzeng Wu

In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…

Combinatorics · Mathematics 2015-01-16 Sheng Chen , Yilong Zhang

For any Legendrian knot in (R^3,ker(dz-ydx)), we show that the existence of an augmentation to any field of the Chekanov-Eliashberg differential graded algebra over Z[t,t^{-1}] is equivalent to the existence of a ruling of the front…

Symplectic Geometry · Mathematics 2014-03-21 C. Leverson

Witten's conjecture suggests that the polynomial invariants of Donaldson are expressible in terms of the Seiberg-Witten invariants if the underlying four-manifold is of simple type. A higher rank version of the Donaldson invariants was…

Differential Geometry · Mathematics 2012-05-09 Raphael Zentner

We study the dual graph polynomials and the case when a Feynman graph has no triangles but has a 4-face. This leads to the proof of the duality-admissibility of all graphs up to 18 loops. As a consequence, the $c_2$ invariant is the same…

Algebraic Geometry · Mathematics 2015-08-17 Dmitry Doryn

New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…

Group Theory · Mathematics 2024-05-16 Henry Wilton

We provide a complete invariant for graph C*-algebras which are amplified in the sense that whenever there is an edge between two vertices, there are infinitely many. The invariant used is the standard primitive ideal space adorned with a…

Operator Algebras · Mathematics 2013-02-06 Søren Eilers , Efren Ruiz , Adam P. W. Sørensen

We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…

Logic in Computer Science · Computer Science 2015-05-08 Nans Lefebvre
‹ Prev 1 3 4 5 6 7 10 Next ›