English
Related papers

Related papers: On area-minimizing subgraphs in integer lattices

200 papers

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

Combinatorics · Mathematics 2015-09-25 Tristram C. Bogart , Edward D. Kim

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

In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…

Combinatorics · Mathematics 2025-04-30 Thang Pham , Steven Senger , Michael Tait , Vu Thi Huong Thu

In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…

Analysis of PDEs · Mathematics 2023-06-28 Mengqiu Shao , Yunyan Yang , Liang Zhao

We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…

Discrete Mathematics · Computer Science 2019-12-30 Yidan Zhang , Xiaolong Huang , Zhipeng Xu , Yuefan Deng

We prove an algebraic version of the Gauge-Invariant Uniqueness Theorem, a result which gives information about the injectivity of certain homomorphisms between ${\mathbb Z}$-graded algebras. As our main application of this theorem, we…

Rings and Algebras · Mathematics 2008-02-04 G. Abrams , P. N. Ánh , A. Louly , E. Pardo

The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into Gamma_f, the f-dimensional Fibonacci cube. We give bounds on the Fibonacci dimension of a graph in terms of…

Combinatorics · Mathematics 2009-03-17 Sergio Cabello , David Eppstein , Sandi Klavzar

A topology is introduced on spaces of Legendrian submanifolds and groups of contactomorphisms. The definition is motivated by the Alexandrov topology in Lorentz geometry.

Symplectic Geometry · Mathematics 2021-07-12 Vladimir Chernov , Stefan Nemirovski

We consider the Dirichlet Laplacian in unbounded strips on ruled surfaces in any space dimension. We locate the essential spectrum under the condition that the strip is asymptotically flat. If the Gauss curvature of the strip equals zero,…

Mathematical Physics · Physics 2022-08-22 David Krejcirik , Katerina Zahradova

We deal with the minimal Lagrangian surfaces of the Einstein-K\"ahler surface $S^2 \times S^2$, studying local geometric properties and showing that they can be locally described as Gauss maps of minimal surfaces in $S^3 \subset R^4$. We…

Differential Geometry · Mathematics 2012-12-04 Ildefonso Castro , Francisco Urbano

End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…

Combinatorics · Mathematics 2024-09-02 Jan Kurkofka , Max Pitz

We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…

Optimization and Control · Mathematics 2015-01-05 Edwin R. van Dam , Renata Sotirov

Graph-structured data is central to many scientific and industrial domains, where the goal is often to optimize objectives defined over graph structures. Given the combinatorial complexity of graph spaces, such optimization problems are…

Optimization and Control · Mathematics 2025-09-25 Shiqiang Zhang , Ruth Misener

We consider some distinguished classes of elements of a multiplicative lattice endowed with coarse lower topologies, and call them lower spaces. The primary objective of this paper is to study the topological properties of these lower…

Rings and Algebras · Mathematics 2024-07-08 Amartya Goswami

We introduce a canonical isomorphism from the space of pure-type complex differential forms on a compact complex manifold to the one on its infinitesimal deformations. By use of this map, we generalize an extension formula in a recent work…

Complex Variables · Mathematics 2019-09-30 Sheng Rao , Quanting Zhao

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

Combinatorics · Mathematics 2017-12-27 Péter E. Frenkel

We show that closed, immersed, minimal hypersurfaces in a compact symmetric space satisfy a lower bound on the index plus nullity, which depends linearly on their first Betti number. Moreover, if either the minimal hypersurface satisfies a…

Differential Geometry · Mathematics 2021-05-25 Ricardo A. E. Mendes , Marco Radeschi

We introduce a Lie algebra of initial terms of logarithmic vector fields along a hypersurface singularity. Extending the formal structure theorem in [GS06, Thm. 5.4], we show that the completely reducible part of its linear projection lifts…

Algebraic Geometry · Mathematics 2009-11-16 Michel Granger , Mathias Schulze

In this paper, a supersymmetric extension of the minimal surface equation is formulated. Based on this formulation, a Lie superalgebra of infinitesimal symmetries of this equation is determined. A classification of the one-dimensional…

Mathematical Physics · Physics 2018-01-30 A. Michel Grundland , Alexander J. Hariton

Let k be a natural number. We introduce k-threshold graphs. We show that there exists an O(n^3) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of…

Combinatorics · Mathematics 2015-03-19 Ling-Ju Hung , Ton Kloks , Fernando Villaamil
‹ Prev 1 8 9 10 Next ›