Related papers: Quasisymmetric graphs and Zygmund functions
In this paper we study quasiconformal curves which are a special case of quasiregular curves. Namely embeddings $\Omega\rightarrow\mathbb{R}^m$ from some domain $\Omega\subset\mathbb{R}^n$ to $\mathbb{R}^m$, where $n\leq m$, which belong in…
Dual equivalence graphs are a powerful tool in symmetric function theory that provide a general framework for proving that a given quasisymmetric function is symmetric and Schur positive. In this paper, we study a larger family of graphs…
This article analyzes sublinearly quasisymmetric homeo-morphisms (generalized quasisymmetric mappings), and draws applications to the sublinear large-scale geometry of negatively curved groups and spaces. It is proven that those…
An important problem in applications of quasiconformal analysis and in its numerical aspect is to establish algorithms for explicit or approximate determination of the basic quasiinvariant curvelinear and analytic functionals intrinsically…
This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…
We prove that a self-homeomorphism of the Grushin plane is quasisymmetric if and only if it is metrically quasiconformal and if and only if it is geometrically quasiconformal. As the main step in our argument, we show that a quasisymmetric…
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. This provides a universal method for…
Surface mapping plays an important role in geometric processing. They induce both area and angular distortions. If the angular distortion is bounded, the mapping is called a {\it quasi-conformal} map. Many surface maps in our physical world…
We introduce a quasisymmetric class function associated with a group acting on a double poset or on a directed graph. The latter is a generalization of the chromatic quasisymmetric function of a digraph introduced by Ellzey, while the…
The chromatic symmetric function $X_G$ of a graph $G$ was introduced by Stanley. In this paper we introduce a quasisymmetric generalization $X^k_G$ called the $k$-chromatic quasisymmetric function of $G$ and show that it is positive in the…
For a generalized permutohedron $Q$ the enumerator $F(Q)$ of positive lattice points in interiors of maximal cones of the normal fan $\Sigma_Q$ is a quasisymmetric function. We describe this function for the class of nestohedra as a Hopf…
We generalize the notion of quasielliptic curves, which have infinitesimal symmetries and exist only in characteristic two and three, to a remarkable hierarchy of regular curves having infinitesimal symmetries, defined in all…
We introduce the notion of a quasi-connected reductive group over an arbitrary field to be an almost direct product of a connected semisimple group and a quasi-torus (a smooth group of multiplicative type). We show that a linear algebraic…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of…
We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…
Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a characterisation of graphs quasi-isometric to graphs of…
Our goal is to provide a survey of some topics in quasiconformal analysis of current interest. We try to emphasize ideas and leave proofs and technicalities aside. Several easily stated open problems are given. Most of the results are joint…