English
Related papers

Related papers: On area-minimizing subgraphs in integer lattices

200 papers

We study the Dirichlet problem of the following discrete infinity Laplace equation on a subgraph with finite width $$\Delta_{\infty} u(x) = \inf_{y \sim x}u(y)+\sup_{y \sim x}u(y)-2u(x) = f(x).$$ We say that a subgraph has finite width if…

Analysis of PDEs · Mathematics 2023-11-06 Fengwen Han , Tao Wang

We consider a variant of a problem first introduced by Hughes and Rudnick (2003) and generalized by Bernard (2015) concerning conditional bounds for small first zeros in a family of $L$-functions. Here we seek to estimate the size of the…

Number Theory · Mathematics 2024-04-12 Antonio Pedro Ramos

Jaberi [7] presented approximation algorithms for the problem of computing a minimum size 2-vertex strongly biconnected subgraph in directed graphs. We have implemented approximation algorithms presented in [7] and we have tested the…

Data Structures and Algorithms · Computer Science 2022-10-19 Azzam Habib

We study generalizations of the "contraction-deletion" relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman,…

Combinatorics · Mathematics 2007-05-23 Laszlo Lovasz , Balazs Szegedy

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…

Geometric Topology · Mathematics 2015-11-03 Yohsuke Watanabe

We study the subalgebra of the lattice vertex operator algebra $V_{\sqrt{2}A_2}$ consisting of the fixed points of an automorphism which is induced from an order 3 isometry of the root lattice $A_2$. We classify the simple modules for the…

Quantum Algebra · Mathematics 2013-12-18 Kenichiro Tanabe , Hiromichi Yamada

Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In…

Rings and Algebras · Mathematics 2022-01-11 George Grätzer , Harry Lakser

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

Combinatorics · Mathematics 2015-01-14 Felix Pogorzelski

This paper concerns the \textbf{abstract geometry of numbers}: namely the pursuit of certain aspects of geometry of numbers over a suitable class of normed domains. (The standard geometry of numbers is then viewed as geometry of numbers…

Number Theory · Mathematics 2014-05-12 Pete L. Clark

Following Beurling's theorem and a study of the topology of invariant subspaces by R. Douglas and C. Pearcy description of path connected components of invariant subspace lattice for shift of multiplicity one has been given by R.Yang. This…

Functional Analysis · Mathematics 2011-01-18 Giorgi Shonia

In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of…

Analysis of PDEs · Mathematics 2021-06-10 Nouhayla Ait Oussaid , Khalid Akhlil , Sultana Ben Aadi , Mourad El Ouali , Anand Srivastav

We present an extension of the classical De Giorgi class, and then we show that functions in this new class are locally bounded and locally H\"older continuous. Some applications are given. As a first application, we give a regularity…

Analysis of PDEs · Mathematics 2022-12-09 Hongya Gao , Aiping Zhang , Siyu Gao

The study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dimensional vector space $\Gamma(\mathbb{V})$ was put forward…

Combinatorics · Mathematics 2026-04-09 Sunilkumar M. Hosamani

Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…

Combinatorics · Mathematics 2010-10-26 László Lovász , Balázs Szegedy

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

Commutative Algebra · Mathematics 2025-06-10 Somayeh Moradi , Fahimeh Khosh-Ahang Ghasr

We construct a Riemannian metric $g$ on $\mathbb{R}^4$ (arbitrarily close to the euclidean one) and a smooth simple closed curve $\Gamma\subset \mathbb R^4$ such that the unique area minimizing surface spanned by $\Gamma$ has infinite…

Differential Geometry · Mathematics 2019-07-02 Camillo De Lellis , Guido De Philippis , Jonas Hirsch

In this paper, we consider immersed two-sided minimal hypersurfaces in $\mathbb{R}^n$ with finite total curvature. We prove that the sum of the Morse index and the nullity of the Jacobi operator is bounded from below by a linear function of…

Differential Geometry · Mathematics 2017-08-28 Chao Li

We consider non-zero endomorphisms of the Dales and Davie algebras of infinitely differentiable functions on intervals in the real line. We discuss necessary and sufficient conditions for a selfmap of the interval to induce a compact…

Functional Analysis · Mathematics 2007-05-23 J. F. Feinstein , H. Kamowitz

We study the local symplectic algebra of parameterized curves introduced by V. I. Arnold. We use the method of algebraic restrictions to classify symplectic singularities of quasi-homogeneous curves. We prove that the space of algebraic…

Symplectic Geometry · Mathematics 2010-01-19 Wojciech Domitrz

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

Rings and Algebras · Mathematics 2019-12-12 Piotr M. Hajac , Mariusz Tobolski