Related papers: Zygmund graphs are thin for doubling measures

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

We develop a diagrammatic categorification of the polynomial ring Z[x], based on a geometrically defined graded algebra. This construction generalizes to categorification of some special functions, such as Chebyshev polynomials.…

Suppose A is an open subset of a Carnot group G, where G has a discrete analogue, and H is another Carnot group. We show that a Lipschitz function from A to H whose image has positive Hausdorff measure in the appropriate dimension is…

We show that rough isometries between metric spaces X, Y can be lifted to the spaces of real valued 1-Lipschitz functions over X and Y with supremum metric and apply this to their scaling limits. For the inverse, we show how rough…

Given a weighted graph $G$ embedded in a non-orientable surface $\Sigma$, one can consider the corresponding weighted graph $\widetilde{G}$ embedded in the so-called orientation cover $\widetilde\Sigma$ of $\Sigma$. We prove identities…

An invertible function is bi-Lipschitz if both the function and its inverse have bounded Lipschitz constants. Nowadays, most Normalizing Flows are bi-Lipschitz by design or by training to limit numerical errors (among other things). In this…

The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…

For any Calder\'on-Zygmund operator $ T$, any weight $ w$, and $ \alpha >1$, the operator $ T$ is bounded as a map from $ L ^{1} (M _{ L \log\log L (\log\log\log L) ^{\alpha } } w )$ into weak-$L^1(w)$. The interest in questions of this…

We study the least doubling constant $C_G$ among all possible doubling measures defined on a path graph $G$. We consider both finite and infinite cases and show that, if $G=\mathbb Z$, $C_{\mathbb Z}=3$, while for $G=L_n$, the path graph…

The rearrangement inequalities of Hardy-Littlewood and Riesz say that certain integrals involving products of two or three functions increase under symmetric decreasing rearrangement. It is known that these inequalities extend to integrands…

Let R be a polynomial ring in r variables and D a dual ring upon which R acts as partial differential operators (classical apolarity). For a type two graded level Artinian algebras A=R/I, of socle degree j we consider the family of Artinian…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

In literature it is shown that bi-Lipschitz maps between self-similar sets or self-affine sets enjoy a locally measure preserving property, namely, if $f:(E,\mu)\to (F,\nu)$ is a bi-Lipschitz map, then the Radon-Nykodym derivative…

An additive map $T$ acting between spaces of vector-valued functions is said to be biseparating if $T$ is a bijection so that $f$ and $g$ are disjoint if and only if $Tf$ and $Tg$ are disjoint. Note that an additive bijection retains…

A graph $G$ is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that…

Let G be a graph with undirected and directed edges. Its representation is given by assigning a vector space to each vertex, a bilinear form on the corresponding vector spaces to each directed edge, and a linear map to each directed edge.…

Let 0<n<d be integers and let H denote the n-dimensional Hausdorff measure restricted to an n-dimensional Lipschitz graph in R^d with slope strictly less than 1. For r>2, we prove that the r-variation and oscillation for Calder\'on-Zygmund…

Lipschitz constants for the width and diameter functions of a convex body in $\mathbb R^n$ are found in terms of its diameter and thickness (maximum and minimum of both functions). Also, a dual approach to thickness is proposed.

Twin-width is a recently introduced graph parameter. In this article, we compute twin-width of various finite graphs. In particular, we prove that the twin-widths of finite graphs with 4 and 5 vertices are less than equal to 1 and 2,…

In this work we attempt to count the number of integer-valued $h$-Lipschitz functions (functions that change by at most $h$ along edges) on two classes of sparse graphs; grid graphs $L_{m,n}$, and sparse random graphs $G(n,d/n)$. We find…