English
Related papers

Related papers: Singularity for graph-directed conjugate equations…

200 papers

We report on some recent existence and uniqueness results for elliptic equations subject to Dirichlet boundary condition and involving a singular nonlinearity. We take into account the following types of problems: (i) singular problems with…

Analysis of PDEs · Mathematics 2007-05-23 Vicentiu Radulescu

We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 Alexander I. Bobenko , Yuri B. Suris

We obtain a unified picture for the conifold singularity resolution. We propose that gauged supergravity, through a novel prescription for the twisting, provides an appropriate framework to smooth out singularities in the context of gravity…

High Energy Physics - Theory · Physics 2010-04-05 J. D. Edelstein , A. Paredes , A. V. Ramallo

We consider smooth flows preserving a smooth invariant measure, or, equivalently, locally Hamiltonian flows on compact orientable surfaces and show that almost every such locally Hamiltonian flow with only simple saddles has singular…

Dynamical Systems · Mathematics 2025-05-20 Krzysztof Frączek , Adam Kanigowski , Corinna Ulcigrai

The {\it two-fold singularity} has played a significant role in our understanding of uniqueness and stability in piecewise smooth dynamical systems. When a vector field is discontinuous at some hypersurface, it can become tangent to that…

Dynamical Systems · Mathematics 2015-06-04 Mike R. Jeffrey

A graph $G$ is weakly $\gamma$-closed if every induced subgraph of $G$ contains one vertex $v$ such that for each non-neighbor $u$ of $v$ it holds that $|N(u)\cap N(v)|<\gamma$. The weak closure $\gamma(G)$ of a graph, recently introduced…

Discrete Mathematics · Computer Science 2022-11-04 Tomohiro Koana , Christian Komusiewicz , Frank Sommer

A strongly connected graph is strongly biconnected if after ignoring the direction of its edges we have an undirected graph with no articulation points. A 3-vertex strongly biconnected graph is a strongly biconnected digraph that has the…

Data Structures and Algorithms · Computer Science 2022-11-29 Azzam Habib

This article provides an account of the functorial correspondence between irreducible singular $G$-monopoles on $S^1\times \Sigma$ and $\vec{t}$-stable meromorphic pairs on $\Sigma$. The main theorem of [1] is thus generalized here from…

Differential Geometry · Mathematics 2015-11-26 Benjamin H. Smith

The weighted dual graph of a two-dimensional normal singularity $(X, x)$ represents the topological nature of the exceptional locus of its minimal log resolution. $(X, x)$ and its graph are said to be taut if the singularity can be uniquely…

Algebraic Geometry · Mathematics 2015-02-26 Yuki Tanaka

The main goal of this paper is proving the fixed point theorem for finite groups acting on weakly systolic complexes. As corollaries we obtain results concerning classifying spaces for the family of finite subgroups of weakly systolic…

Group Theory · Mathematics 2012-09-26 Victor Chepoi , Damian Osajda

Motivated by applications in data science, we study partial differential equations on graphs. By a classical fixed-point argument, we show existence and uniqueness of solutions to a class of nonlocal continuity equations on graphs. We…

Analysis of PDEs · Mathematics 2023-06-06 A. Esposito , F. S. Patacchini , A. Schlichting

We introduce the study of isolated singularities for a semilinear equation involving the fractional Laplacian. In conformal geometry, it is equivalent to the study of singular metrics with constant fractional curvature. Our main ideas are:…

Analysis of PDEs · Mathematics 2015-04-15 Azahara DelaTorre , María del Mar González

We propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending Finite…

Numerical Analysis · Mathematics 2024-11-01 Beatrice Crippa , Anna Scotti , Andrea Villa

This paper provides a framework to evaluate the performance of single and double integrator networks over arbitrary directed graphs. Adopting vehicular network terminology, we consider quadratic performance metrics defined by the L2-norm of…

Systems and Control · Electrical Eng. & Systems 2019-11-05 H. Giray Oral , Enrique Mallada , Dennice F. Gayme

\emph{Bidirected graphs} (a sort of nonstandard graphs introduced by Edmonds and Johnson) provide a natural generalization to the notions of directed and undirected graphs. By a \emph{weakly (node- or edge-) acyclic} bidirected graph we…

Combinatorics · Mathematics 2007-05-23 Maxim A. Babenko

Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…

Analysis of PDEs · Mathematics 2024-08-01 Alessio Figalli , André Guerra , Sunghan Kim , Henrik Shahgholian

We prove that solutions to elliptic equations in two variables in divergence form, possibly non-selfadjoint and with lower order terms, satisfy the strong unique continuation property.

Analysis of PDEs · Mathematics 2013-06-24 Giovanni Alessandrini

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

We investigate regularity properties of generalized conjugate functions induced by a general coupling function and the associated generalized proximal mapping. Our main results provide verifiable conditions ensuring local single-valuedness,…

Optimization and Control · Mathematics 2026-04-07 Konstantinos Oikonomidis , Emanuel Laude , Panagiotis Patrinos

We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…

Symbolic Computation · Computer Science 2011-01-18 Angelos Mantzaflaris , Bernard Mourrain
‹ Prev 1 3 4 5 6 7 10 Next ›