English
Related papers

Related papers: Nowhere differentiable intrinsic Lipschitz graphs

200 papers

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…

Combinatorics · Mathematics 2020-08-26 Andrzej Grzesik , Daniel Král' , László Miklós Lovász

We will determine all infinite $2$-locally finite groups as well as infinite $2$-groups with planar subgroup graph and show that infinite groups satisfying the chain conditions containing an involution do not have planar embeddings. Also,…

Group Theory · Mathematics 2014-03-04 Mehdi Rajabian , Mohammad Farrokhi Derakhshandeh Ghouchan , Ahmad Erfanian

We show that if n>1 then there exists a Lebesgue null set in R^n containing a point of differentiability of each Lipschitz function mapping from R^n to R^(n-1); in combination with the work of others, this completes the investigation of…

Functional Analysis · Mathematics 2014-03-12 David Preiss , Gareth Speight

We give a new approach to the infinitesimal structure of Lipschitz maps into L^1. As a first application, we give an alternative proof of the main theorem from an earlier paper, that the Heisenberg group does not admit a bi-Lipschitz…

Metric Geometry · Mathematics 2015-05-13 Jeff Cheeger , Bruce Kleiner

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

Combinatorics · Mathematics 2023-10-11 Pallabi Manna , Santanu Mandal , Manideepa Saha

In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. K\"{o}nig proved that every infinite graph contains either a ray or a vertex of infinite degree. In…

Combinatorics · Mathematics 2024-12-06 Sarah Allred , Guoli Ding , Bogdan Oporowski

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

Combinatorics · Mathematics 2014-04-02 Johannes Carmesin

We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…

Metric Geometry · Mathematics 2024-01-18 Sean Dewar

The purpose of this paper is to introduce and study some basic concepts of quantitative rectifiability in the first Heisenberg group $\mathbb{H}$. In particular, we aim to demonstrate that new phenomena arise compared to the Euclidean…

Classical Analysis and ODEs · Mathematics 2018-04-12 Vasileios Chousionis , Katrin Fässler , Tuomas Orponen

We construct a family of finite special 2-groups which have commuting graph of increasing diameter

Group Theory · Mathematics 2012-10-02 Michael Giudici , Chris Parker

We show that any Carnot group contains a closed nowhere dense set which has measure zero but is not $\sigma$-porous with respect to the Carnot-Carath\'eodory (CC) distance. In the first Heisenberg group we observe that there exist sets…

Metric Geometry · Mathematics 2017-07-25 Andrea Pinamonti , Gareth Speight

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

Group Theory · Mathematics 2017-01-30 J. Jonušas , J. D. Mitchell

We consider splittings of groups over finite and two-ended subgroups. We study the combinatorics of such splittings using generalisations of Whitehead graphs. In the case of hyperbolic groups, we relate this to the topology of the boundary.…

Group Theory · Mathematics 2016-09-07 B. H. Bowditch

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…

Dynamical Systems · Mathematics 2024-06-28 Paul-Henry Leemann , Tatiana Nagnibeda , Alexandra Skripchenko , Georgii Veprev

We prove that a typical Lipschitz mapping between any two Banach spaces is non-differentiable at typical points of any given subset of its domain in the most extreme form. This is a new result even for Lipschitz mappings between Euclidean…

Functional Analysis · Mathematics 2025-04-11 Michael Dymond , Olga Maleva

We prove that a family of entire intrinsic minimal graphs in the Heisenberg group are not perimeter minimizing.

Differential Geometry · Mathematics 2007-05-23 D. Danielli , N. Garofalo , D. M. Nhieu

We study the class of all finite directed graphs up to primitive positive constructability. The resulting order has a unique greatest element, namely the graph $P_1$ with one vertex and no edges. The graph $P_1$ has a unique greatest lower…

Combinatorics · Mathematics 2022-10-11 Florian Starke , Manuel Bodirsky

We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…

Functional Analysis · Mathematics 2023-01-06 Daniel Lenz , Simon Puchert , Marcel Schmidt

A standard combinatorial construction, due to Kontsevich, associates to any A-infinity algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We…

Quantum Algebra · Mathematics 2007-05-23 Alastair Hamilton , Andrey Lazarev
‹ Prev 1 4 5 6 7 8 10 Next ›