中文
相关论文

相关论文: On the uniqueness for the heat equation with densi…

200 篇论文

We study the behaviour near a boundary point a of any positive solution of a nonlinear elliptic equations with forcing term which vanishes on the boundary except at a. Our results are based upon a priori estimates for solutions and…

偏微分方程分析 · 数学 2007-05-23 Marie-Francoise Bidaut-Veron , Augusto Ponce , Laurent Veron

P. Erd\H{o}s [On extremal problems of graphs and generalized graphs, Israel Journal of Mathematics 2 (1964), 183-190] characterised those hypergraphs $F$ that have to appear in any sufficiently large hypergraph $H$ of positive density. We…

组合数学 · 数学 2019-01-30 Christian Reiher , Vojtěch Rödl , Mathias Schacht

In this short note, we prove the uniqueness of exterior differentiation on locally finite graphs.

经典分析与常微分方程 · 数学 2020-01-28 Yongjie Shi , Chengjie Yu

The class of nonlinear integral equations on the positive half-line with a monotone operator of Hammerstein type is studied. With various partial representations of the corresponding kernel and nonlinearity, this class of equations has…

偏微分方程分析 · 数学 2024-04-10 Zahra Keyshams , Khachatur Aghavardovich Khachatryan , Monire Mikaeili Nia

In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent…

组合数学 · 数学 2016-12-08 Sona Pavlikova , Daniel Sevcovic

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

离散数学 · 计算机科学 2016-06-22 Jonathan Gorard

We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy-Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite…

经典分析与常微分方程 · 数学 2016-02-03 Javier Soria , Pedro Tradacete

We prove that a class of superlinear indefinite problems with homogeneous Neumann boundary conditions admits an arbitrarily high number of positive solutions, provided that the parameters of the problem are adequately chosen. The…

经典分析与常微分方程 · 数学 2018-07-19 Andrea Tellini

The burning and forcing processes are both instances of propagation processes on graphs that are commonly used to model real-world spreading phenomena. The contribution of this paper is two-fold. We first establish a connection between…

组合数学 · 数学 2026-02-16 Aida Abiad , Pax Mallee

We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…

组合数学 · 数学 2007-10-11 Mireille Boutin , Gregor Kemper

We study the propagation of energy density in finite-energy weak solutions of the Camassa-Holm and related equations. Developing the methods based on generalized nonunique characteristics, we show that the parts of energy related to…

偏微分方程分析 · 数学 2016-11-10 Grzegorz Jamróz

We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…

组合数学 · 数学 2026-04-30 Mauro Passacantando , Fabio Raciti

We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…

We consider two species of particles performing random walks in a domain in $\mathbb{R}^d$ with reflecting boundary conditions, which annihilate on contact. In addition, there is a conservation law so that the total number of particles of…

概率论 · 数学 2007-05-23 Krzysztof Burdzy , Jeremy Quastel

The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum…

组合数学 · 数学 2010-10-19 Hamed Hatami , Serguei Norine

We study a generalization of the classical hidden clique problem to graphs with real-valued edge weights. Formally, we define a hypothesis testing problem. Under the null hypothesis, edges of a complete graph on $n$ vertices are associated…

For a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of…

组合数学 · 数学 2024-07-09 Andrea C. Burgess , Robert D. Luther , David A. Pike

The problem of continuation of a partially defined metric can be efficiently studied using graph theory. Let $G=G(V,E)$ be an undirected graph with the set of vertices $V$ and the set of edges $E$. A necessary and sufficient condition under…

一般拓扑 · 数学 2025-01-06 Evgeniy Petrov

We investigate Gevrey order and 1-summability properties of the formal solution of a general heat equation in two variables. In particular, we give necessary and sufficient conditions for the 1-summability of the solution in a given…

动力系统 · 数学 2010-06-15 Werner Balser , Michèle Loday-Richaud

One or two negative mass singularities are found to occur in static inhomogeneous spatially closed solutions to the Einstein equations. The singularities produce a positive Komar mass, and this decreases the size of the cosmological…

广义相对论与量子宇宙学 · 物理学 2026-04-29 Bob Holdom