English
Related papers

Related papers: Dual Filtered Graphs

200 papers

We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…

Operator Algebras · Mathematics 2026-04-22 Valentin Deaconu , Menevşe Eryüzlü Paulovicks , S. Kaliszewski , John Quigg

Stable Grothendieck polynomials can be viewed as a K-theory analog of Schur polynomials. We extend stable Grothendieck polynomials to a two-parameter version, which we call canonical stable Grothendieck functions. These functions have the…

Combinatorics · Mathematics 2016-09-13 Damir Yeliussizov

Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_\mu(G):=A(G)-\mu D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M…

Combinatorics · Mathematics 2025-09-03 Yi-Zheng Fan , Ruo-Jie Xing , Yi-Liu Zhang , Wei Wang

We prove that finding a $k$-edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial observations, Gauss' famous \emph{Eureka} theorem [Andrews,…

Data Structures and Algorithms · Computer Science 2012-05-02 Bingkai Lin , Yijia Chen

A graph $G$ admiting a $2$-factor is \textit{pseudo $2$-factor isomorphic} if the parity of the number of cycles in all its $2$-factors is the same. In [M. Abreu, A.A. Diwan, B. Jackson, D. Labbate and J. Sheehan. Pseudo $2$-factor…

Combinatorics · Mathematics 2022-07-25 M. Abreu , M. Funk , D. Labbate , F. Romaniello

We define dual-critical graphs as graphs having an acyclic orientation, where the indegrees are odd except for the unique source. We have very limited knowledge about the complexity of dual-criticality testing. By the definition the problem…

Data Structures and Algorithms · Computer Science 2014-10-08 Zoltán Király , Sándor Kisfaludi-Bak

We extend Wood's graph theoretic interpretation of certain quotients of the mod $2$ dual Steenrod algebra to quotients of the mod $p$ dual Steenrod algebra where $p$ is an odd prime and to quotients of the $C_2$-equivariant dual Steenrod…

Algebraic Topology · Mathematics 2026-01-08 Connor Elliott , Courtney Hauf , Kai Morton , Sarah Petersen , Leticia Schow

We review recent progress in numerical simulations with dually transformed SU(2) LGT, starting with a discussion of explicit dual amplitudes and algorithms for SU(2) pure Yang Mills in D=3 and D=4. In the D=3 case, we discuss results that…

High Energy Physics - Lattice · Physics 2008-10-06 J. Wade Cherrington

Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…

Combinatorics · Mathematics 2019-07-05 Lisa Berry , Stefan Forcey , Maria Ronco , Patrick Showers

We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon…

Combinatorics · Mathematics 2013-10-24 Sami H. Assaf

Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…

Rings and Algebras · Mathematics 2025-09-18 Lisa Orloff Clark , Malcolm Jones

Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…

Combinatorics · Mathematics 2016-05-25 Alice M. W. Hui , Bernardo Rodrigues

Higher-rank graph generalisations of the Popescu-Poisson transform are constructed, allowing us to develop a dilation theory for higher rank operator tuples. These dilations are joint dilations of the families of operators satisfying…

Operator Algebras · Mathematics 2008-06-16 Adam Skalski , Joachim Zacharias

Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA '14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, $K_t$-free unit…

Data Structures and Algorithms · Computer Science 2021-10-26 Édouard Bonnet , Eun Jung Kim , Stéphan Thomassé , Rémi Watrigant

This paper considers two logics. The first one, $\mathbf{K}\mathsf{G}_\mathsf{inv}$, is an expansion of the G\"odel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim_\mathsf{i}$ defined as…

Logic · Mathematics 2024-01-30 Marta Bilkova , Thomas Ferguson , Daniil Kozhemiachenko

The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…

Combinatorics · Mathematics 2024-08-01 Nikos Apostolakis

We give a Pieri-type formula for the sum of $K$-$k$-Schur functions $\sum_{\mu\le\lambda} g^{(k)}_{\mu}$ over a principal order ideal of the poset of $k$-bounded partitions under the strong Bruhat order, which sum we denote by…

Combinatorics · Mathematics 2018-05-08 Motoki Takigiku

Bergeron and Li have introduced a set of axioms which guarantee that the Grothendieck groups of a tower of algebras $\bigoplus_{n\ge0}A_n$ can be endowed with the structure of graded dual Hopf algebras. Hivert and Nzeutzhap, and…

Combinatorics · Mathematics 2011-09-27 Nantel Bergeron , Thomas Lam , Huilan Li

We give a constructive account of the fundamental ingredients of Poisson Lie theory as the basis for a description of the classical double group $D$. The double of a group $G$ has a pointwise decomposition $D\sim G\times G^*$, where $G$ and…

High Energy Physics - Theory · Physics 2008-02-03 K. S. Ahluwalia

Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…

Logic in Computer Science · Computer Science 2024-02-15 Tim Seppelt