Search arXivSearch

arXiv · 2505.07965

Defects in weighted graphs and Commutators

Abstract

Let $R$ be a commutative ring. In \cite{KK_2025(1)}, the authors introduced $R$-weighted graphs as a tool for studying commutators in groups and Lie algebras. These graphs are equivalent to a system of balance equations, and their consistent labelings correspond to solutions of this system of balance equations. In this article, we apply these ideas in the case when $R$ is a field $F$. We focus on $F$-weighted graphs with four vertices and establish necessary and sufficient conditions for the existence of consistent labelings on them. A notion of defects in weighted graphs is introduced for this purpose. We prove that defects in weighted graphs prevent Lie brackets from being surjective onto its derived Lie subalgebra. Similarly, these defects prevent certain elements in the commutator subgroup of a nilpotent group of class $2$ from being a commutator. As an application of our techniques, we prove that for a Lie algebra $L$ whose dimension over $F$ is at most countable and the dimension of its derived subalgebra $L'$ is at most $3$, the Lie bracket is surjective onto $L'$. We provide a counterexample when $\dim(L') = 4$. We also characterize commutators among $L$' for the Lie algebras $L$ with $\dim(L/Z(L))\leq 4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Harish Kishnani, Amit Kulshrestha. 2025-05-12. Defects in weighted graphs and Commutators. https://arxiv.org/abs/2505.07965

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO