Related papers: Quasisymmetric graphs and Zygmund functions
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
For every pair of vertices u and v with d(u; v) = n, Wun G v denotes the set of all vertices of G that are closer to u than to v. In this paper, we introduce quasi-({\lambda}; n)-distance-balanced graphs and then study some properties of…
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed…
The ring of symmetric functions occupies a central place in algebraic combinatorics, with a particularly notable role in Schubert calculus, where the standard cell decompositions of Grassmannians yield the celebrated family of Schur…
We study functions defined on a closed segment of the real line that belong to the class of Gonchar. We show that the graphs of such functions are pluripolar. We also discuss the generalizations of our result to functions defined on a…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…
A measure-scaling quasi-isometry between two connected graphs is a quasi-isometry that is quasi-$\kappa$-to-one in a natural sense for some $\kappa>0$. For non-amenable graphs, all quasi-isometries are quasi-$\kappa$-to-one for any…
Quantum Graphity is an approach to quantum gravity based on a background independent formulation of condensed matter systems on graphs. We summarize recent results obtained on the notion of emergent geometry from the point of view of a…
We examine the correspondence between the various notions of quasirandomness for k-uniform hypergraphs and sigma-algebras related to measurable hypergraphs. This gives a uniform formulation of most of the notions of quasirandomness for…
The paper continues the author's research in the problem of quantitative investigation of basic curvelinear quasiinvariants of quasiconformal curves. It concerns polygons with infinite number of vertices and provides various distortion…
Biserial algebras are a classical class in the representation theory of algebras, generalizing Nakayama algebras. They were further generalized by Green and Schroll to multiserial algebras, which share many structural properties with…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
In a normed space setting, this paper studies the conditions under which the projected solutions to a quasi equilibrium problem with non-self constraint map exist. Our approach is based on an iterative algorithm which gives rise to a…
A quasislit is the image of a vertical line segment [0, iy], y > 0, under a quasiconformal homeomorphism of the upper half-plane fixing infinity. Quasislits correspond precisely to curves generated by the Loewner equation with a driving…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
A fibration of graphs is an homomorphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. Recently, it has been shown that graph fibrations are useful…
The main purpose of the present paper is to define and study the notion of quasi bi-slant submanifolds of almost contact metric manifolds. We mainly concerned with quasi bi-slant submanifolds of cosymplectic manifolds as a generalization of…
We recall the definition of quasinearly subharmonic functions, point out that this function class includes, among others, subharmonic functions, quasisubharmonic functions, nearly subharmonic functions and essentially almost subharmonic…