English
Related papers

Related papers: Local negative circuits and fixed points in Boolea…

200 papers

Let ${\cal G}=(G,w) $ be a positive-weighted graph, that is a graph $G$ endowed with a function $w$ from the edge set of $G$ to the set of positive real numbers; for any distinct vertices $i,j $, we define $D_{i,j}({\cal G})$ to be the…

Combinatorics · Mathematics 2016-05-04 Agnese Baldisserri , Elena Rubei

Let $F$ be an $(r+1)$-color critical graph with $r\geq 2$, that is, $\chi(F)=r+1$ and there is an edge $e$ in $F$ such that $\chi(F-e)=r$. Gerbner recently conjectured that every $n$-vertex maximal $F$-free graph with at least…

Combinatorics · Mathematics 2022-05-04 Jian Wang , Shipeng Wang , Weihua Yang

The classical Brouwer fixed point theorem states that in R^d every continuous function from a convex, compact set on itself has a fixed point. For an arbitrary probability space, let L^0 = L^0 (\Omega, A,P) be the set of random variables.…

Functional Analysis · Mathematics 2013-09-13 Samuel Drapeau , Martin Karliczek , Michael Kupper , Martin Streckfuß

This paper deals with the existence of positive solutions for the nonlinear system q(t)\phi(p(t)u'_{i}(t)))'+f^{i}(t,\textbf{u})=0,\quad 0<t<1,\quad i=1,2,...,n. This system often arises in the study of positive radial solutions of…

Analysis of PDEs · Mathematics 2007-07-16 Jifeng Chu , Donal O'Regan , Meirong Zhang

We consider a strongly nonlinear differential equation of the following general type $$(\Phi(a(t,x(t)) \, x'(t)))'= f(t,x(t),x'(t)), \quad \text{a.e. on $[0,T]$}$$ where $f$ is a Carath\'edory function, $\Phi$ is a strictly increasing…

Classical Analysis and ODEs · Mathematics 2019-10-25 Stefano Biagi , Alessandro Calamai , Francesca Papalini

In this work, we define the concept of mixed $G$-monotone mappings defined on a metric space endowed with a graph. Then we obtain sufficient conditions for the existence of coupled fixed points for such mappings when a weak contractivity…

Functional Analysis · Mathematics 2018-01-24 M. R. Alfuraidan , M. A. Khamsi

Graph convolutional networks (GCNs) and its variants are designed for unsigned graphs containing only positive links. Many existing GCNs have been derived from the spectral domain analysis of signals lying over (unsigned) graphs and in each…

Machine Learning · Computer Science 2022-08-16 Rahul Singh , Yongxin Chen

We prove that any random variable $X$ whose moment generating function is point-wise upper bounded by that of $ G \sim \mathcal{N}(0,1) $ must be dominated by $ G/\mathbb{E}[|G|] $ in convex order, meaning $ \mathbb{E}[f(X)] \le…

Probability · Mathematics 2026-04-30 Yihan Zhang

For a Boolean function $\Phi\colon\{0,1\}^d\to\{0,1\}$ and an assignment to its variables $\mathbf{x}=(x_1, x_2, \dots, x_d)$ we consider the problem of finding the subsets of the variables that are sufficient to determine the function…

Computational Complexity · Computer Science 2019-06-19 Stephan Wäldchen , Jan Macdonald , Sascha Hauch , Gitta Kutyniok

Our main result states that every fixed-point free continuous self-map of ${\mathbb R}^{n}$ is colorable. This result can be re-formulated as follows: A continuous map $f: {\mathbb R}^{n}\to {\mathbb R}^{n}$ is fixed-point free iff…

General Topology · Mathematics 2010-11-24 R. Z. Bouziakova , A. Chigogidze

\emph{Zero forcing number}, $Z(G)$, of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G) \setminus S$ are colored white) such that $V(G)$ is turned black after finitely many applications of…

Combinatorics · Mathematics 2012-05-08 Cong X. Kang , Eunjeong Yi

A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m…

Computational Complexity · Computer Science 2012-04-18 S. Jukna , G. Schnitger

On a real ($\mathbb F=\mathbb R$) or complex ($\mathbb F=\mathbb C$) analytic connected 2-manifold $M$ with empty boundary consider two vector fields $X,Y$. We say that $Y$ {\it tracks} $X$ if $[Y,X]=fX$ for some continuous function…

Dynamical Systems · Mathematics 2016-06-28 Morris W. Hirsch , F. -J. Turiel

An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree. It is well known that Eulerian graphs can be…

Data Structures and Algorithms · Computer Science 2013-04-23 Fedor V. Fomin , Petr A. Golovach

We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…

Functional Analysis · Mathematics 2013-06-20 Idione Meneghel , Rabee Tourky

An undirected graph $G$ is said to admit an antimagic orientation if there exist an orientation $D$ and a bijection between $E(G)$ and $\{1,2,\ldots,|E(G)|\}$ such that any two vertices have distinct vertex sums, where the vertex sum of a…

Combinatorics · Mathematics 2024-08-29 Eranda Dhananjaya , Wei-Tian Li

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

Group Theory · Mathematics 2007-05-23 Matt Clay

We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…

Number Theory · Mathematics 2023-03-24 Phakhinkon Napp Phunphayap , Passawan Noppakaew , Prapanpong Pongsriiam

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

To formulate our results let $f$ be a continuous map from $\mathbb R^n$ to $2^{\mathbb R^n}$ and $k$ a natural number such that $|f(x)|\leq k$ for all $x$. We prove that $f$ is fixed-point free if and only if its continuous extension…

General Topology · Mathematics 2012-06-14 Raushan Buzyakova