English
Related papers

Related papers: A quadratic estimation for the K\"uhnel conjecture…

200 papers

We demonstrate under appropriate finiteness conditions that a coarse embedding induces an inequality of homological Dehn functions. Applications of the main results include a characterization of what finitely presentable groups may admit a…

Geometric Topology · Mathematics 2020-11-19 Robert Kropholler , Mark Pengitore

Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…

Combinatorics · Mathematics 2016-11-02 Jie Han

We establish an inclusion relation between two uniform models of random $k$-graphs (for constant $k \ge 2$) on $n$ labeled vertices: $\mathbb G^{(k)}(n,m)$, the random $k$-graph with $m$ edges, and $\mathbb R^{(k)}(n,d)$, the random…

Combinatorics · Mathematics 2019-11-12 Andrzej Dudek , Alan Frieze , Andrzej Ruciński , Matas Šileikis

We show that for any integers k and g, with g at least two, there are infinitely many closed hyperbolic 3-manifolds which are integral homology spheres with Casson invariant k, and Heegaard genus equal to g. This existence result is shown…

Geometric Topology · Mathematics 2014-05-27 Alexander Lubotzky , Joseph Maher , Conan Wu

The quadratic embedding constant (QEC) of a finite, simple, connected graph originated from the classical work of Schoenberg [Ann. of Math., 1935] and [Trans. Amer. Math. Soc., 1938] on Euclidean distance geometry. In this article, we study…

Combinatorics · Mathematics 2026-05-01 Projesh Nath Choudhury , Raju Nandi

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

Spectral Theory · Mathematics 2013-08-27 Evans M. Harell , Joachim Stubbe

We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our…

Computational Geometry · Computer Science 2022-08-31 Radoslav Fulek , Jan Kynčl

Let $G_{n,k}$ denote the real Grassmann manifold of $k$-dimensional vector subspaces of $\mathbb R^n$. Using the Hodgkin spectral sequence, we compute the complex $K$-ring of $G_{n,k}$, up to a small indeterminacy, for all values of $n,k$…

K-Theory and Homology · Mathematics 2022-12-14 Sudeep Podder , Parameswaran Sankaran

For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…

Classical Analysis and ODEs · Mathematics 2017-08-22 N. Chatzikonstantinou , A. Iosevich , S. Mkrtchyan , J. Pakianathan

It was proved by Scott that for every $k\ge2$, there exists a constant $c(k)>0$ such that for every bipartite $n$-vertex graph $G$ without isolated vertices, there exists an induced subgraph $H$ of order at least $c(k)n$ such that…

Combinatorics · Mathematics 2022-01-04 Zach Hunter

We investigate the homology of ample Hausdorff groupoids. We establish that a number of notions of equivalence of groupoids appearing in the literature coincide for ample Hausdorff groupoids, and deduce that they all preserve groupoid…

Operator Algebras · Mathematics 2018-08-24 Carla Farsi , Alex Kumjian , David Pask , Aidan Sims

A Robinson similarity matrix is a symmetric matrix where the entry values on all rows and columns increase toward the diagonal. Decompose the Robinson matrix into the sum of k {0, 1}-matrices, then these k {0, 1}-matrices are the adjacency…

Combinatorics · Mathematics 2021-05-20 Jeannette Janssen , Zhiyuan Zhang

Let K be an infinite field and let R be a K-algebra endowed with a homogeneous polynomial norm N of degree n. If N satisfies a formal analogue of the Cayley-Hamilton Theorem the we will show that R is a quotient of the ring of the…

Rings and Algebras · Mathematics 2007-05-23 Francesco Vaccarino

We define an isotopy invariant of embeddings N -> R^m of manifolds into Euclidean space. This invariant together with the \alpha-invariant of Haefliger-Wu is complete in the dimension range where the \alpha-invariant could be incomplete. We…

Geometric Topology · Mathematics 2008-12-06 A. Skopenkov

Carath\'eodory's conjecture has long been regarded as one of the central problems in the classical theory of convex surfaces. In this paper, we establish an index formula for hemispheres of convex closed surfaces under $C^2$-regularity. The…

Differential Geometry · Mathematics 2026-01-06 Naoya Ando , Masaaki Umehara

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

Combinatorics · Mathematics 2007-05-23 Svante Linusson , John Shareshian , Volkmar Welker

The curvature estimates of $k$ curvature equations for general right hand side is a longstanding problem. In this paper, we totally solve the $n-1$ case and we also discuss some applications for our estimate.

Analysis of PDEs · Mathematics 2020-02-21 Changyu Ren , Zhizhang Wang

In [36, Section 8], the present author proposed the hypergraph obstruction for the existence of k-regular embeddings. In this paper, we develop the hypergraph obstruction concretely and give some homological obstructions for the k-regular…

Algebraic Topology · Mathematics 2026-01-12 Shiquan Ren

Given a function $g=g(n)$ we let ${\mathcal E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in some surface of Euler genus at most $g(n)$, and let ${\widetilde{\mathcal…

Combinatorics · Mathematics 2021-08-11 Colin McDiarmid , Sophia Saller

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas