Daniel Cizma, Nati Linial
A path system $\mathcal{P}$ in a graph $G=(V,E)$ is said to be irreducible if there does not exist a partition $V= A\sqcup B$ such that $\mathcal{P}$ restricts to a path system on both $G[A]$ and $G[B]$. In this paper, we construct an infinite family of non-metrizable irreducible path systems defined on certain Paley graphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The Structure of Metrizable Graphs
本文研究可度量图的结构，证明其本质上是一小类基本图的细分并带相容边，且至少11个顶点的可度量图是外平面图加一个顶点。
Strictly Metrizable Graphs are Minor-Closed
本文证明严格可度量图（即每个一致路径系统可由正边权实现为唯一测地线系统的图）的族在子式运算下封闭。
A complete classification of metrizable and strictly metrizable theta graphs
本文完全分类了可度量theta图，证明当且仅当a≤2或(a,b,c)=(3,3,3)时Θ_{a,b,c}可度量，通过构造性方法和拓扑子图闭包给出证明。
We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices $y, z$ are in $P_{u,v}$, then the sub-path of $P_{u,v}$ between them coincides with $P_{y,z}$. A map $w: E\to(0,\infty)$ is said to induce $\mathcal{P}$ if for every $u, v\in V$ the path $P_{u,v}$ is $w$-geodesic. We say that $G$ is metrizable if every consistent path system is induced by some such $w$. As we show, metrizable graphs are very rare, whereas t…
On the Structure of Unique Shortest Paths in Graphs
该研究刻画了实权重图中唯一最短路径系统的强可度量化性，提出多面体对模式作为新的禁止子系统，分别给出有向、无向路径系统强可度量化的充要条件，并探讨了相关结构性质与场景改进。
Phylogenetic trees are often constructed by using a metric on the set of taxa that label the leaves of the tree. While there are a number of methods for constructing a tree using a given metric, such trees will only display the metric if it satisfies the so-called "four point condition", established by Buneman in 1971. While this condition guarantees that a unique tree will display the metric, meaning that the distance between any two leaves can be found by adding the distances on arcs in the path between the leaves, it doesn't exclude the possibility that a phylogenetic network might also dis…
We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers $V_λ^{\otimes N}$ of an irreducible representation $V_λ$ of a compact connected Lie group $G$. The weights are allowed to depend on $N$, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope.
We give an explicit combinatorial formula for some irreducible components of $GL_k\times \mathbb{S}_n$-modules of multivariate diagonal harmonics. To this end we introduce a new path combinatorial object $T_{n,s}$ allowing us to give the formula directly in terms of Schur functions. This paper also contains formulas written in terms of Schur functions in the $q$ and $t$ variables for special cases of $\nabla(e_n)$, $\nabla^r(e_n)$ and $Δ'_{e_k}(e_n)$. We also give an interpretation in term of path to the adjoint dual Pieri rule applied on these $GL_k\times \mathbb{S}_n$-characters.
We prove a conjecture of Naito-Sagaki about a branching rule for the restriction of irreducible representations of $\mathfrak{sl}(2n,\mathbb{C})$ to $\mathfrak{sp}(2n,\mathbb{C})$. The conjecture is in terms of certain Littelmann paths, with the embedding given by the folding of the type $A_{2n-1}$ Dynkin diagram.
Let $G$ be a connected graph and $u,v$ and $w$ vertices of $G$. Then $w$ is said to {\em strongly resolve} $u$ and $v$, if there is either a shortest $u$-$w$ path that contains $v$ or a shortest $v$-$w$ path that contains $u$. A set $W$ of vertices of $G$ is a {\em strong resolving set} if every pair of vertices of $G$ is strongly resolved by some vertex of $W$. A smallest strong resolving set of a graph is called a {\em strong basis} and its cardinality, denoted $β_s(G)$, the {\em strong dimension} of $G$. The {\em threshold strong dimension} of a graph $G$, denoted $τ_s(G)$, is the smallest …
In this paper, we continue the development of a new combinatorial model for the irreducible characters of a complex semisimple Lie group. This model, which will be referred to as the alcove path model, can be viewed as a discrete counterpart to the Littelmann path model. It leads to an extensive generalization of the combinatorics of irreducible characters from Lie type A (where the combinatorics is based on Young tableaux, for instance) to arbitrary type. The main results of this paper are: (1) a combinatorial description of the crystal graphs corresponding to the irreducible representations …
A mapping $α: V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we consider isometric embeddings of a weighted graph $G$ into unweighted Hamming graphs, called Hamming embeddings, when $G$ satisfies the property that every edge is a shortest path between its endpoints. Using a Cartesian product decomposition of $G$ called its pseudofactorization, we show that every Hamming embedding of $G$ may be partitioned into Hamming embedding…
We classify all solutions (p,q) to the equation p(u)q(u)=p(u+b)q(u+a) where p and q are complex polynomials in one indeterminate u, and a and b are fixed but arbitrary complex numbers. This equation is a special case of a system of equations which ensures that certain algebras defined by generators and relations are non-trivial. We first give a necessary condition for the existence of non-trivial solutions to the equation. Then, under this condition, we use combinatorics of generalized Dyck paths to describe all solutions and a canonical way to factor each solution into a product of irreducibl…
This paper provides a combinatorial dictionary between three sets of objects: Bernstein-Zelevinsky multisegments, Kleshchev multipartitions, and the irreducible modules of the affine Hecke algebra $H_n$ (for generic $q$). In particular, we compute the action of the crystal operator $\tilde{e}_i$ (a refinement of socle of Restriction) on an irreducible module both in terms of its parameterization by multisegments and by multipartitions. In other words, we give explicit crystal graph isomorphisms. A byproduct is the determination of which multisegments parameterize modules of the {\it cyclotomic…
To each finite-dimensional representation of a simple Lie algebra is associated a multiplicative graph in the sense of Kerov and Vershik definedfrom the decomposition of its tensor powers into irreducible components. The conditioning of naturalrandom Littelmann paths to stay in their corresponding Weyl chamber is thencontrolled by central measures on this type of graphs. Using the K-theory of associated C*-algebras, Handelman established a homeomorphism between the set of central measures on these multiplicative graphs and the weight polytope of theunderlying representation. In the present pap…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。