English
Related papers

Related papers: Stepanov Differentiability Theorem for intrinsic g…

200 papers

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

Combinatorics · Mathematics 2007-10-23 Andy Frohmader

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

Combinatorics · Mathematics 2024-02-14 R. Dogra , S. Lando

We develop a new method leading to an elementary proof of a generalization of Gromov's theorem about non existence of H\"older embeddings into the Heisenberg group.

Geometric Topology · Mathematics 2023-12-22 Piotr Hajłasz , Armin Schikorra

We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescu's theorem for higher rank graphs. Afterwards we will examine the properties of…

Operator Algebras · Mathematics 2015-12-07 S. Kaliszewski , Adam Morgan , John Quigg

We use a Riemannnian approximation scheme to define a notion of $\textit{sub-Riemannian Gaussian curvature}$ for a Euclidean $C^{2}$-smooth surface in the Heisenberg group $\mathbb{H}$ away from characteristic points, and a notion of…

Differential Geometry · Mathematics 2016-04-04 Zoltán Balogh , Jeremy T. Tyson , Eugenio Vecchi

In this paper, we develop a $\times$-homotopy fundamental groupoid for graphs, and show a functorial relationship to the 2-category of graphs. We further explore the fundamental groupoid of graph products and develop a groupoid product…

Combinatorics · Mathematics 2020-07-14 Tien Chih , Laura Scull

This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…

Functional Analysis · Mathematics 2010-04-30 Murad Banaji

We study a family of Riemannian problems on the Heisenberg group that tends to the sub-Riemannian problem on this group.

Optimization and Control · Mathematics 2025-11-26 Yu. Sachkov

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

Computational Complexity · Computer Science 2014-12-02 Christian Engels

We prove an exact analogue of Ingham's uncertainty principle for the group Fourier transform on the Heisenberg group. This is accomplished by explicitly constructing compactly supported functions on the Heisenberg group whose…

Classical Analysis and ODEs · Mathematics 2022-04-22 Sayan Bagchi , Pritam Ganguly , Jayanta Sarkar , Sundaram Thangavelu

We prove that, in the first Heisenberg group $\mathbb{H}$, an entire locally Lipschitz intrinsic graph admitting vanishing first variation of its sub-Riemannian area and non-negative second variation must be an intrinsic plane, i.e., a…

Differential Geometry · Mathematics 2018-09-13 Sebastiano Nicolussi , Francesco Serra Cassano

In the spirit of an earlier result of M\"uller on the Heisenberg group we prove a restriction theorem on a certain class of two step nilpotent Lie groups. Our result extends that of M\"uller also in the framework of the Heisenberg group.

Functional Analysis · Mathematics 2023-02-14 Valentina Casarino , Paolo Ciatti

We derive the Helmholtz theorem for stochastic Hamiltonian systems. Precisely, we give a theorem characterizing Stratonovich stochastic differential equations, admitting a Hamiltonian formulation. Moreover, in the affirmative case, we give…

Probability · Mathematics 2015-07-23 Frédéric Pierret

Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.

Combinatorics · Mathematics 2014-01-07 L. Nguyen Van Thé

We establish the following theorem of Bernstein type for the first Heisenberg group: Let S be a C^2 connected H-minimal surface which is a graph over some plane P, then S is either a non-characteristic vertical plane, or its generalized…

Differential Geometry · Mathematics 2007-05-23 Nicola Garofalo , Scott D. Pauls

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

Logic · Mathematics 2025-07-14 Jana Maříková

In this note, we present a simple directed graph proof of Sharkovsky's theorem.

Dynamical Systems · Mathematics 2007-05-23 Bau-Sen Du

We generalize the computation of Feynman integrals of log divergent graphs in terms of the Kirchhoff polynomial to the case of graphs with both fermionic and bosonic edges, to which we assign a set of ordinary and Grassmann variables. This…

High Energy Physics - Theory · Physics 2008-11-26 Matilde Marcolli , Abhijnan Rej

The Heisenberg groups are examples of sub-Riemannian manifolds homeomorphic, but not diffeomorphic to the Euclidean space. Their metric is derived from curves which are only allowed to move in so-called horizontal directions. We report on…

Metric Geometry · Mathematics 2018-10-19 Armin Schikorra

In this paper, we establish a Reshetnyak type theorem for quasiregular values on the setting of Carnot group of $H$-type.

Metric Geometry · Mathematics 2025-09-26 Deguang Zhong