Related papers: Quasisymmetric graphs and Zygmund functions
Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur…
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
We show that the quotient associated to a quasi-Hamiltonian space has a symplectic structure even when 1 is not a regular value of the momentum map: it is a disjoint union of symplectic manifolds of possibly different dimensions, which…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
Using methods of stable homotopy theory, the category of symmetric quasi-coherent sheaves associated with non-commutative graded algebras with extra symmetries is introduced and studied in this paper. It is shown to be a closed symmetric…
The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this…
For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…
We define and study graphs associated to hexagon decompositions of surfaces by curves and arcs. One of the variants is shown to be quasi-isometric to the pants graph, whereas the other variant is quasi-isometric to (a Cayley graph of) the…
The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…
We study the moduli space of twisted quasimaps from a fixed smooth projective curve to a Nakajima's quiver variety and the moduli space of $\delta$-stable framed twisted quiver bundles with moment map relations. We show that they carry…
We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for $\theta$-Hermitian adjacency matrices defined by an angle $\theta \in (0, \pi]$. We show that this equivalence holds when, for example, an angle…
Given a connected, locally finite, quasi-transitive graph $X$ which is quasi-isometric to a planar graph $\Gamma$, we remark that one can upgrade $\Gamma$ to be a planar Cayley graph, answering a question raised by Esperet--Giocanti and…
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
Introduced by C. R. Shallon in 1979, graph algebras establish a useful connection between graph theory and universal algebra. This makes it possible to investigate graph varieties and graph quasivarieties, i.e., classes of graphs described…
In this work we study smooth complex quasi-projective surfaces whose fundamental group is a free product of cyclic groups. In particular, we prove the existence of an admissible map from the quasi-projective surface to a smooth complex…
Harmonic morphisms are maps between Riemannian manifolds that pull back harmonic functions to harmonic functions. These maps are characterized as horizontally weakly conformal harmonic maps and they have many interesting links and…
Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut vertices, that is, vertices whose removal disconnect the…
We initiate a study of the quasisymmetric uniformization of naturally arising random fractals and show that many of them fall outside the realm of quasisymmetric uniformization to simple canonical spaces. We begin with the trace, the graph…
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…