相关论文: Solutions of Reeder's Puzzle

This paper addresses two open questions posed in [27] regarding the balanced domination number in graphs. We show that three new classes of graphs, those of convex polytopes A_n, D_n, and Rn'', are d-balanced. Further, we provide a…

Coxeter and Dynkin diagrams classify a wide variety of structures, most notably finite reflection groups, lattices having such groups as symmetries, compact simple Lie groups and complex simple Lie algebras. The simply laced or "ADE" Dynkin…

Starting from a generalized Reedy category $R$ satisfying a simple condition, we construct an absolutely dense functor $\mathbf{D}_R \to R$ with domain a strict Reedy category. In the case of a generalized inverse category $R$, and given…

Proposed as a general framework, Liu and Yu(Discrete Math. 231 (2001) 311-320) introduced $(n,k,d)$-graphs to unify the concepts of deficiency of matchings, $n$-factor-criticality and $k$-extendability. Let $G$ be a graph and let $n,k$ and…

We obtain a complete derived equivalence classification of the cluster-tilted algebras of Dynkin type E. There are 67, 416, 1574 algebras in types E6, E7 and E8 which turn out to fall into 6, 14, 15 derived equivalence classes,…

An ADE Dynkin diagram gives rise to a family of algebraic curves. In this paper, we use arithmetic invariant theory to study the integral points of the curves associated to the exceptional diagrams $E_6, E_7$, $E_8$. These curves are…

A typical decomposition question asks whether the edges of some graph $G$ can be partitioned into disjoint copies of another graph $H$. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the…

Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of embedded trees and map enumeration. The aim of this note is to apply this method to three problems.…

This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems.

We study associative multiplications in semi-simple associative algebras over C compatible with the usual one. An interesting class of such multiplications is related to the affine Dynkin diagrams of A, D, E-type. In this paper we…

We show that, for every $r, k$, there is an $n = n(r,k)$ so that any $r$-coloring of the edges of the complete graph on $[n]$ will yield a monochromatic complete subgraph on vertices ${a + \sum_{i \in I} d_i \mid I \subseteq [k]}$ for some…

Series solutions for a large family of single equation Dyson-Schwinger equations are given as expansions over decorated rooted connected chord diagrams. The analytic input to the new expansions are the expansions of the regularized…

We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poenitz…

Planar arrays of tree diagrams were introduced as a generalization of Feynman diagrams that enables the computation biadjoint amplitudes $m^{(k)}_n$ for $k>2$ . In this follow-up work we investigate the poles of $m^{(k)}_n$ from the…

We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…

Reed Conjecture is open for more than 20 years now. Here we prove that Reed Conjecture is valid for (1) {P4UnionK1, Kite}-free graphs (2) {Chair, Kite}-free graphs (3) {K2UnionK2complement , H}-free graphs and (4) {2K2, M}-free graphs where…

We examine the generic local and global rigidity of various graphs in R^d. Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d+1)-connectedness and generic redundant rigidity and hypothesized that they…

Invertible transformation of large graphs into fixed dimensional vectors (embeddings) remains a challenge. Its overcoming would reduce any operation on graphs to an operation in a vector space. However, most existing methods are limited to…

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…

We solve the coupled recurrence relations for eigenenergies and -vectors in nondegenerate Rayleigh-Schr\"odinger perturbation theory under the constraint that the approximate eigenvector be normalised to $1$ in every order. The series can…