中文
相关论文

相关论文: Equivalences on Acyclic Orientations

200 篇论文

In this paper we study the equivalence relation on the set of acyclic orientations of a graph Y that arises through source-to-sink conversions. This source-to-sink conversion encodes, e.g. conjugation of Coxeter elements of a Coxeter group.…

组合数学 · 数学 2008-08-21 Matthew Macauley , Henning S. Mortveit

We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver…

组合数学 · 数学 2011-11-14 Matthew Macauley , Henning S. Mortveit

Given graphs $X$ and $Y$ with vertex sets $V(X)$ and $V(Y)$ of the same cardinality, we define a graph $\mathsf{FS}(X,Y)$ whose vertex set consists of all bijections $\sigma:V(X)\to V(Y)$, where two bijections $\sigma$ and $\sigma'$ are…

组合数学 · 数学 2021-06-16 Colin Defant , Noah Kravitz

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

组合数学 · 数学 2009-04-14 Julia Brown

Let $C(T)$ be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either $B_n$ or $D_n$. Let $C_Y(T)$ be a natural quotient of $C(T)$, and if $C(T)$ is simply-laced (which means all the relations…

群论 · 数学 2008-03-21 M. Amram , R. Shwartz , M. Teicher

A new class of simple symmetric digraphs called $\mathcal{D}$ is defined and studied here. Any digraph in $\mathcal{D}$ has the property that each non-pendant vertex is adjacent to at least one pendant vertex. A graph theoretical…

组合数学 · 数学 2025-07-02 Raju Nandi

We introduce a notion of Ricci curvature for Cayley graphs that can be thought of as "medium-scale" because it is neither infinitesimal nor asymptotic, but based on a chosen finite radius parameter. We argue that it gives the foundation for…

群论 · 数学 2020-07-06 Assaf Bar-Natan , Moon Duchin , Robert Kropholler

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

组合数学 · 数学 2026-05-18 Oliver Bernardi , Jonathan J. Fang

Let $G$ be a group and let $S$ be an inverse-closed and identity-free generating set of $G$. The \emph{Cayley graph} $\Cay(G,S)$ has vertex-set $G$ and two vertices $u$ and $v$ are adjacent if and only if $uv^{-1}\in S$. Let $CAY_d(n)$ be…

组合数学 · 数学 2012-10-23 Primoz Potocnik , Pablo Spiga , Gabriel Verret

Quantum symmetry of graph $C^{*}$-algebras has been studied, under the consideration of different formulations, in the past few years. It is already known that the compact quantum group $(\underbrace{C(S^{1})*C(S^{1})*\cdots…

算子代数 · 数学 2024-08-08 Ujjal Karmakar , Arnab Mandal

Let $D=(V,A)$ be an acyclic digraph. For $x\in V$ define $e_{_{D}}(x)$ to be the difference of the indegree and the outdegree of $x$. An acyclic ordering of the vertices of $D$ is a one-to-one map $g: V \rightarrow [1,|V|] $ that has the…

组合数学 · 数学 2014-12-03 Thomas Bier , Imed Zaguia

Topological quivers generalize the notion of directed graphs in which the sets of vertices and edges are locally compact (second countable) Hausdorff spaces. Associated to a topological quiver $Q$ is a $C^*$-correspondence, and in turn, a…

算子代数 · 数学 2013-01-31 Shawn J. McCann

Barber and Erde asked the following question: if $B$ generates $\mathbb Z^d$ as an additive group, then must the extremal sets for the vertex/edge-isoperimetric inequality on the Cayley graph $\operatorname{Cay}(\mathbb Z^d,B)$ form a…

组合数学 · 数学 2026-01-15 Joseph Briggs , Chris Wells

We present an algorithm that, given finite simplicial sets $X$, $A$, $Y$ with an action of a finite group $G$, computes the set $[X,Y]^A_G$ of homotopy classes of equivariant maps $\ell \colon X \to Y$ extending a given equivariant map $f…

代数拓扑 · 数学 2022-11-28 Marek Filakovský , Lukáš Vokřínek

Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in…

组合数学 · 数学 2011-01-11 A. Krzysztof Kwasniewski , M. Dziemianczuk

We prove that the Cayley graph and the coset geometry of the von Dyck group $D(a,b,c)$ are linked by a vertex-to-edge duality.

组合数学 · 数学 2013-10-25 Giovanni Moreno , Monika Ewa Stypa

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

范畴论 · 数学 2025-12-23 Clémence Chanavat , Amar Hadzihasanovic

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

群论 · 数学 2024-03-20 P. J. Cameron , F. E. Jannat , R. K. Nath , R. Sharafdini

We introduce the notion of orbit equivalence of directed graphs, following Matsumoto's notion of continuous orbit equivalence for topological Markov shifts. We show that two graphs in which every cycle has an exit are orbit equivalent if…

算子代数 · 数学 2017-05-23 Nathan Brownlowe , Toke Meier Carlsen , Michael F. Whittaker

Let R be the set of isomorphism classes of ideals in the Weyl algebra $A=A_{1}$, and let C be the set of isomorphism classes of triples (V; X, Y), where V is a finite-dimensional (complex) vector space, and X, Y are endomorphisms of V such…

代数几何 · 数学 2007-05-23 Yuri Berest , George Wilson
‹ 上一页 1 2 3 10 下一页 ›