English
Related papers

Related papers: Blurred maximal cyclically monotone sets and bipot…

200 papers

The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…

Mathematical Physics · Physics 2020-01-29 Freddy Cachazo , Karen Yeats , Samuel Yusim

It is well-known that in every $r$-coloring of the edges of the complete bipartite graph $K_{m,n}$ there is a monochromatic connected component with at least ${m+n\over r}$ vertices. In this paper we study an extension of this problem by…

Combinatorics · Mathematics 2019-10-10 Louis DeBiasio , Robert A. Krueger , Gábor N. Sárközy

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

Combinatorics · Mathematics 2011-08-19 Cam McLeman , Erin McNicholas

In this note we use recent results concerning the sum theorem for maximal monotone multifunctions in general Banach spaces to find new characterizations and properties of regular maximal monotone multifunctions and then use these to…

Functional Analysis · Mathematics 2008-12-16 Andrei Verona , Maria Elena Verona

The ``multiple of the inclusion plus compact problem'' which was posed by T.W. Gowers in 1996 and Th. Schlumprecht in 2003, asks whether for every infinite dimensional Banach space $X$ there exists a closed subspace $Y$ of $X$ and a bounded…

Functional Analysis · Mathematics 2007-05-23 George Androulakis , Frank Sanacory

We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…

Computational Complexity · Computer Science 2016-04-20 Andreas Darmann , Janosch Döcker , Britta Dorn

Our basic element is a $C^1$ mapping $f:X\to Y$, with $X,Y$ Banach spaces, and with derivative everywhere invertible. So $f$ is a local diffeomorphism at every point. The aim of this paper is to find a sufficient condition for $f$ to be…

Functional Analysis · Mathematics 2012-04-20 Gaetano Zampieri

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

Combinatorics · Mathematics 2014-10-30 Stephane Durocher , David S. Gunderson , Pak Ching Li , Matthew Skala

We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$, $a\geq3$, satisfying $d(u)+d(v)\geq 3a$ for every pair of vertices $u,v$ with a common in-neighbour or a common out-neighbour, is either bipancyclic or a…

Combinatorics · Mathematics 2018-05-25 Janusz Adamus

Let Pi: M -> B be an onto maximal rank map or a Riemannian submersion between Riemannian manifolds M and B. Initially, we prove necessary and sufficient conditions for any fiber F to be roughly isometric to M. Then, we prove necessary and…

Differential Geometry · Mathematics 2007-05-23 C. Abreu-Suzuki

Let $G$ be a connected graph. If $G$ contains a matching of size $k$, and every matching of size $k$ is contained in a perfect matching of $G$, then $G$ is said to be \emph{$k$-extendable}. A $k$-regular spanning subgraph of $G$ is called a…

Combinatorics · Mathematics 2022-11-18 Dandan Fan , Huiqiu Lin

Clustering bipartite graphs is a fundamental task in network analysis. In the high-dimensional regime where the number of rows $n_1$ and the number of columns $n_2$ of the associated adjacency matrix are of different order, existing methods…

Statistics Theory · Mathematics 2023-02-28 Guillaume Braun , Hemant Tyagi

Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its adjacency matrix. For a non-complete bipartite graph $G$ with parts $X$ and $Y$, the {\em bipartite toughness} of $G$ is defined as…

Combinatorics · Mathematics 2025-08-07 Lianyang Ai , Wenqian Zhang

The epsilon-enlargement of a maximal monotone operator is a construct similar to the Br{\o}ndsted and Rocakfellar epsilon-subdifferential enlargement of the subdifferential. Like the epsilon-subdifferential, the epsilon-enlargement of a…

Functional Analysis · Mathematics 2010-05-25 B. F. Svaiter

Let $E$ and $G$ be two Banach function spaces, let $T \in \mathcal{L}(E,Y)$, and let ${\langle X,Y \rangle}$ be a Banach dual pair. In this paper we give conditions for which there exists a (necessarily unique) bounded linear operator…

Functional Analysis · Mathematics 2015-10-20 Nick Lindemulder

This paper deals with the problem of when, given a collection $\mathcal C$ of weakly compact operators between separable Banach spaces, there exists a separable reflexive Banach space $Z$ with a Schauder basis so that every element in…

Functional Analysis · Mathematics 2019-09-18 Leandro Antunes , Kevin Beanland , Bruno de Mendonça Braga

In this paper, we construct maximally monotone operators that are not of Gossez's dense-type (D) in many nonreflexive spaces. Many of these operators also fail to possess the Br{\o}nsted-Rockafellar (BR) property. Using these operators, we…

Functional Analysis · Mathematics 2011-08-09 Heinz H. Bauschke , Jonathan M. Borwein , Xianfu Wang , Liangjin Yao

R. M. Brown's theorem on mixed Dirichlet and Neumann boundary conditions is extended in two ways for the special case of polyhedral domains. A (1) more general partition of the boundary into Dirichlet and Neumann sets is used on (2)…

Analysis of PDEs · Mathematics 2008-03-07 Moises Venouziou , Gregory C. Verchota

Strongly chordal digraphs are included in the class of chordal digraphs and generalize strongly chordal graphs and chordal bipartite graphs. They are the digraphs that admit a linear ordering of its vertex set for which their adjacency…

Combinatorics · Mathematics 2025-09-24 Pavol Hell , César Hernández-Cruz , Jing Huang

We provide a sufficient condition for the sum of a finite number of complemented subspaces of a Banach space to be complemented. Under this condition a formula for a projection onto the sum is given. We also show that the condition is sharp…

Functional Analysis · Mathematics 2018-07-23 Ivan Feshchenko