English
Related papers

Related papers: On Lie algebra weight systems for 3-graphs

200 papers

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Group Theory · Mathematics 2021-03-29 Peter J. Cameron

Based on the distinction between the covariant and contravariant metric tensor components in the framework of the affine geometry approach and also on the choice of the contravariant components, it was shown that a wide variety of third,…

Mathematical Physics · Physics 2009-11-06 Bogdan G. Dimitrov

In a previous article, we define "connectivity weights" to be functions with these two properties: 1) They solve the three conformal Ward identities of conformal field theory (CFT) and a system of $2N$ null-state differential equations…

Mathematical Physics · Physics 2021-12-28 Steven M. Flores , Jacob J. H. Simmons , Peter Kleban

The paper presents the complete classification of Automorphic Lie Algebras based on $\mathfrak{sl}_n (\mathbb{C})$, where the symmetry group $G$ is finite and the orbit is any of the exceptional $G$-orbits in $\overline{\mathbb{C}}$. A key…

Mathematical Physics · Physics 2019-11-20 Vincent Knibbeler , Sara Lombardo , Jan A. Sanders

The \emph{metric dimension} of a graph $G$, denoted by $\dim(G)$, is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices. Let $G_1$ and $G_2$ be disjoint copies of a graph $G$…

Combinatorics · Mathematics 2013-12-30 Linda Eroh , Cong X. Kang , Eunjeong Yi

This is a short presentation of some classical results on finite dimensional complex Lie algebras (classification of nilpotent Lie algebras, deformations and perturbations, contractions and rigidity). We present some applications to…

Rings and Algebras · Mathematics 2008-05-06 Michel Goze

We observe that a system of irreducible, fiber-linear, first class constraints on T*M is equivalent to the definition of a foliation Lie algebroid over M. The BFV formulation of the constrained system is given by the Hamiltonian lift of the…

Mathematical Physics · Physics 2019-02-20 Noriaki Ikeda , Thomas Strobl

A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…

Combinatorics · Mathematics 2026-02-16 Kecai Deng

A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Examples include protein contact maps, RNA secondary structures…

Data Structures and Algorithms · Computer Science 2011-03-08 Yasuo Tabei , Daisuke Okanohara , Shuichi Hirose , Koji Tsuda

A vertex $x$ in a graph $G$ resolves two vertices $u$, $v$ of $G$ if the distance between $u$ and $x$ is not equal to the distance between $v$ and $x$. A function $g$ from the vertex set of $G$ to $[0,1]$ is a resolving function of $G$ if…

Combinatorics · Mathematics 2015-03-13 Min Feng , Kaishun Wang

These notes loosely follow an introductory course on graph complexes, held at Humboldt-Universit\"at zu Berlin in summer 23. Instead of simply typing up my lecture notes I decided to give here an overview over (parts of) the topic (lecture…

Algebraic Topology · Mathematics 2023-12-19 Marko Berghoff

The coherent configuration $\mathsf{WL}(X)$ of a graph $X$ is the smallest coherent configuration on the vertices of $X$ that contains the edge set of $X$ as a relation. The aim of the paper is to study $\mathsf{WL}(X)$ when $X$ is a…

Combinatorics · Mathematics 2024-11-06 Jinzhuan Cai , Jin Guo , Alexander L. Gavrilyuk , Ilia Ponomarenko

Let i be a homomorphism of the multiplicative group into a connected reductive algebraic group over C. Let G^i be the centralizer of the image i. Let LG be the Lie algebra of G and let L_nG (n integer) be the summands in the direct sum…

Representation Theory · Mathematics 2007-05-23 G. Lusztig

The linear codes with a few weights have been applied widely in combinatorial designs, secret sharing, association schemes, authentication codes and strongly regular graphs. In this paper, we first correct an erroneous result about the…

Information Theory · Computer Science 2020-09-21 Fei Li , Xiumei Li

After endowing with a 3-Lie-Rinehart structure on Hom 3-Lie algebras, we obtain a class of special Hom 3-Lie algebras, which have close relationships with representations of commutative associative algebras. We provide a special class of…

Rings and Algebras · Mathematics 2020-01-24 Ruipu Bai , Xiaojuan Lie , Yingli Wu

Let $k$ be a field of any characteristic, $V$ a finite-dimensional vector space over $k$, and $S^d(V^*)$ be the $d$-th symmetric power of the dual space $V^*$. Given a linear map $\varphi$ on $V$ and an eigenvector $w$ of $\varphi$, we…

Rings and Algebras · Mathematics 2025-01-28 Yin Chen

Let $G$ be a simple complex Lie group with Lie algebra $\mf g$ and let $\af$ be the affine Lie algebra. We use intertwining operators and Knizhnik-Zamolodchikov equations to construct a family of $\N$-graded vertex operator algebras…

Quantum Algebra · Mathematics 2007-11-20 Minxian Zhu

In this work, we construct and study certain classes of infinite dimensional Lie groups that are modelled on weighted function spaces. In particular, we construct a Lie group of weighted diffeomorphisms on a Banach space. Further, we also…

Functional Analysis · Mathematics 2014-09-23 Boris Walter

Motivated by properties of higher tangent lifts of geometric structures, we introduce concepts of weighted structures for various geometric objects on a manifold F equipped with a homogeneity structure. The latter is a smooth action on F of…

Differential Geometry · Mathematics 2024-11-04 Janusz Grabowski , Katarzyna Grabowska , Zohreh Ravanpak

Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…

Data Structures and Algorithms · Computer Science 2013-04-26 Harold N. Gabow , Piotr Sankowski
‹ Prev 1 8 9 10 Next ›