English
Related papers

Related papers: Constrained variational problems on perturbed latt…

200 papers

We study gauge fixing via the standard local extremization algorithm for 2-dimensional $U(1)$. On a lattice with spherical topology $S^2$ where all copies are lattice artifacts, we find that the number of these 'Gribov' copies diverges in…

High Energy Physics - Lattice · Physics 2009-10-28 Philippe de Forcrand , James E. Hetrick

We show that if we start from a symmetric lower semi-bounded Schr\"odinger operator $\mathcal{H}$ on finitely supported functions on a discrete weighted graph (satisfying certain conditions), apply the Friedrichs construction to get a…

Spectral Theory · Mathematics 2025-03-17 Ognjen Milatovic

We consider a time-fractional parabolic equation of doubly nonlinear type, featuring nonlinear terms both inside and outside the differential operator in time. The main nonlinearities are maximal monotone graphs, without restrictions on the…

Analysis of PDEs · Mathematics 2025-08-20 Goro Akagi , Giacomo Enrico Sodini , Ulisse Stefanelli

In this paper, we study the existence and instability of standing waves with a prescribed $L^2$-norm for the fractional Schr\"{o}dinger equation \begin{equation} i\partial_{t}\psi=(-\Delta)^{s}\psi-f(\psi), \qquad (0.1)\end{equation} where…

Analysis of PDEs · Mathematics 2019-07-18 Binhua Feng , Jiajia Ren , Qingxuan Wang

The restricted edge-connectivity of a connected graph $G$, denoted by $\lambda^{\prime}(G)$, if it exists, is the minimum cardinality of a set of edges whose deletion makes $G$ disconnected and each component with at least 2 vertices. It…

Combinatorics · Mathematics 2024-01-30 Hazhe Ye , Yingzhi Tian

Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…

Numerical Analysis · Mathematics 2017-12-19 Eleonora Andreotti , Dominik Edelmann , Nicola Guglielmi , Christian Lubich

In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…

Combinatorics · Mathematics 2007-05-23 Dmitry Jakobson , Igor Rivin

We investigate the existence of ground states for the nonlinear Schr\"odinger Equation on star graphs with two subcritical focusing nonlinear terms: a standard power nonlinearity, and a delta-type nonlinearity located at the vertex. We find…

Analysis of PDEs · Mathematics 2024-07-31 Riccardo Adami , Filippo Boni , Simone Dovetta

For a fixed set ${\cal H}$ of graphs, a graph $G$ is ${\cal H}$-subgraph-free if $G$ does not contain any $H \in {\cal H}$ as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on ${\cal…

Discrete Mathematics · Computer Science 2024-05-07 Vadim Lozin , Barnaby Martin , Sukanya Pandey , Daniel Paulusma , Mark Siggers , Siani Smith , Erik Jan van Leeuwen

We study the existence and nonexistence of normalized solutions $(u_a, \lambda_a)\in H^{1}(\mathbb{R}^N)\times \mathbb{R}$ to the nonlinear Schr\"{o}dinger equation with mixed nonlocal nonlinearities. This study can be viewed as a…

Analysis of PDEs · Mathematics 2022-10-26 Yanheng Ding , Hua-Yang Wang

Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G…

Combinatorics · Mathematics 2007-11-21 Wayne Barrett , H. Tracy Hall , Raphael Loewy

Graph modification problems are typically asked as follows: is there a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and…

Data Structures and Algorithms · Computer Science 2014-06-02 Yixin Cao , Dániel Marx

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

Computational Geometry · Computer Science 2023-02-21 Sujoy Bhore , Robert Ganian , Liana Khazaliya , Fabrizio Montecchiani , Martin Nöllenburg

In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on ${n}$ vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation…

Probability · Mathematics 2023-01-13 Ghurumuruhan Ganesan

We study stochastic graph optimization problems in a novel distributed setting. As in the standard centralized setting, a random subgraph $G^*$ of a known base graph $G$ is realized by including each edge $e$ independently with a known…

Data Structures and Algorithms · Computer Science 2026-05-21 Keren Censor-Hillel , Aditi Dudeja , George Giakkoupis

The study of nonlinear Schr\"odinger-type equations with nonzero boundary conditions define challenging problems both for the continuous (partial differential equation) or the discrete (lattice) counterparts. They are associated with…

In this paper, we consider the following nonlinear Schr\"{o}dinger equations with mixed nonlinearities: \begin{eqnarray*} \left\{\aligned &-\Delta u=\lambda u+\mu |u|^{q-2}u+|u|^{2^*-2}u\quad\text{in }\mathbb{R}^N,\\ &u\in…

Analysis of PDEs · Mathematics 2021-02-09 Juncheng Wei , Yuanze Wu

In present paper, we prove the existence of solutions $(\lambda, u)\in \R\times H^1(\R^N)$ to the following Schr\"odinger equation $$ \begin{cases} -\Delta u(x)+V(x)u(x)+\lambda u(x)=g(u(x))\quad &\hbox{in}~\R^N\\ 0\leq u(x)\in H^1(\R^N),…

Analysis of PDEs · Mathematics 2021-11-03 Yanheng Ding , Xuexiu Zhong

In the past decades, many scholars concerned which edge-extremal problems have spectral analogues? Recently, Wang, Kang and Xue showed an interesting result on $F$-free graphs [J. Combin. Theory Ser. B 159 (2023) 20--41]. In this paper, we…

Combinatorics · Mathematics 2025-03-14 Zhenzhen Lou , Changxiang He

While a number of bounds are known on the zero forcing number $Z(G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds that are related to the (upper) total domination number…

Combinatorics · Mathematics 2023-10-12 Boštjan Brešar , María Gracia Cornet , Tanja Dravec , Michael Henning