English
Related papers

Related papers: Homogeneous Subsets of a Lipschitz Graph and the C…

200 papers

We show that the $\beta$--numbers of intrinsic Lipschitz graphs of Heisenberg groups $\mathbb{H}_n$ are locally Carleson integrable when $n \geq 2$. Our technique relies on a recent Dorronsoro inequality \cite{FO} as well as a novel slicing…

Metric Geometry · Mathematics 2020-04-27 Vasileios Chousionis , Sean Li , Robert Young

In this paper, we describe the structure of shape derivatives around sets which are only assumed to be of finite perimeter in $\R^N$. This structure allows us to define a useful notion of positivity of the shape derivative and we show it…

Optimization and Control · Mathematics 2007-05-23 Jimmy Lamboley , Michel Pierre

Let $U$ be a bounded open subset of the complex plane and let $A_{\alpha}(U)$ denote the set of functions analytic on $U$ that also belong to the little Lipschitz class with Lipschitz exponent $\alpha$. It is shown that if $A_{\alpha}(U)$…

Complex Variables · Mathematics 2024-08-06 Stephen Deterding

By finding orthogonal representation for a family of simple connected called $\delta$-graphs it is possible to show that $\delta$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form…

Combinatorics · Mathematics 2018-06-20 Pedro Díaz Navarro

In this paper we extend a method of Arveson and McCullough to prove a tangential interpolation theorem for subalgebras of $H^\infty$. This tangential interpolation result implies a Toelitz corona theorem. In particular, it is shown that the…

Functional Analysis · Mathematics 2011-03-08 Mrinal Raghupathi , Brett D. Wick

Vizing's conjecture (open since 1968) relates the product of the domination numbers of two graphs to the domination number of their Cartesian product graph. In this paper, we formulate Vizing's conjecture as a Positivstellensatz existence…

Combinatorics · Mathematics 2021-08-13 Elisabeth Gaar , Daniel Krenn , Susan Margulies , Angelika Wiegele

Given graphs $X$ and $Y$, we define two conic feasibility programs which we show have a solution over the completely positive cone if and only if there exists a homomorphism from $X$ to $Y$. By varying the cone, we obtain similar…

Combinatorics · Mathematics 2014-11-27 David E. Roberson

This paper studies the geometry of bilipschitz maps $f \colon \mathbb{W} \to \mathbb{H}$, where $\mathbb{H}$ is the first Heisenberg group, and $\mathbb{W} \subset \mathbb{H}$ is a vertical subgroup of co-dimension $1$. The images…

Classical Analysis and ODEs · Mathematics 2020-11-17 Tuomas Orponen

We prove the following theorem: every quasiconformal harmonic mapping between two plane domains with $C^{1,\alpha}$ ($\alpha<1$), respectively $C^{1,1}$ compact boundary is bi-Lipschitz. The distance function with respect to the boundary of…

Complex Variables · Mathematics 2012-02-21 David Kalaj

We prove that the $L_4$ norm of the vertical perimeter of any measurable subset of the $3$-dimensional Heisenberg group $\mathbb{H}$ is at most a universal constant multiple of the (Heisenberg) perimeter of the subset. We show that this…

Metric Geometry · Mathematics 2021-04-30 Assaf Naor , Robert Young

We consider the area functional for t-graphs in the sub-Riemannian Heisenberg group and study minimizers of the associated Dirichlet problem. We prove that, under a bounded slope condition on the boundary datum, there exists a unique…

Metric Geometry · Mathematics 2013-10-29 Andrea Pinamonti , Francesco Serra Cassano , Giulia Treu , Davide Vittone

We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains $\nu_n$ of the $n$-th eigenfunction of the Laplacian with standard…

Spectral Theory · Mathematics 2022-01-05 Marvin Plümer , Matthias Täufer

A graph is \emph{well-dominated} if all of its minimal dominating sets have the same cardinality. We prove that at least one of the factors is well-dominated if the Cartesian product of two graphs is well-dominated. In addition, we show…

Combinatorics · Mathematics 2019-09-24 Sarah E. Anderson , Kirsti Kuenzel , Douglas F. Rall

We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…

Logic in Computer Science · Computer Science 2016-02-16 Libor Barto , Michael Pinsker

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…

Group Theory · Mathematics 2021-12-06 Gabor Kun

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

The main result of the paper is the theorem giving a sufficient condition for the existence of a bounded analytic projection onto a holomorphic family of (generally infinite-dimensional) subspaces (a holomorphic sub-bundle of a trivial…

Classical Analysis and ODEs · Mathematics 2010-05-06 Sergei Treil , Brett Wick

We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…

Combinatorics · Mathematics 2023-04-27 Agelos Georgakopoulos , Alex Wendland

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…

Combinatorics · Mathematics 2020-01-01 Amitesh Sarkar , Anirban Banerjee

An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…

Combinatorics · Mathematics 2024-08-12 Sergey Kitaev , Artem Pyatkin
‹ Prev 1 4 5 6 7 8 10 Next ›