English
Related papers

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

200 papers

A graceful difference labeling (gdl for short) of a directed graph G with vertex set V is a bijection f between V and {1,...,|V|} such that, when each arc uv is assigned the difference label f(v)-f(u), the resulting arc labels are distinct.…

Combinatorics · Mathematics 2019-08-30 Alain Hertz , Christophe Picouleau

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…

Functional Analysis · Mathematics 2025-09-10 Babu G. V. R. , Alemayehu Negash , Sandhya M. L. , Meaza Bogale

Caputo fractional (with power-law kernels) and fractional (delta) difference maps belong to a more widely defined class of generalized fractional maps, which are discrete convolutions with some power-law-like functions. The conditions of…

Chaotic Dynamics · Physics 2023-03-10 Mark Edelman

For a Hausdorff space $X$, we exhibit an unexpected connection between the sectional number of the Fadell-Neuwirth fibration $\pi_{2,1}^X:F(X,2)\to X$, and the fixed point property (FPP) for self-maps on $X$. Explicitly, we demonstrate that…

Algebraic Topology · Mathematics 2021-01-26 Cesar A. Ipanaque Zapata , Jesús González

Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on $n$ vertices and a positive integer parameter $k$, find if there exist $k$ edges (arcs)…

Data Structures and Algorithms · Computer Science 2014-09-18 Prachi Goyal , Pranabendu Misra , Fahad Panolan , Geevarghese Philip , Saket Saurabh

A topological group $G$ has the Approximate Fixed Point (AFP) property on a bounded convex subset $C$ of a locally convex space if every continuous affine action of $G$ on $C$ admits a net $(x_i)$, $x_i\in C$, such that…

Group Theory · Mathematics 2021-02-18 Cleon S. Barroso , Brice R. Mbombo , Vladimir G. Pestov

For every graph $X$, we consider the class of all connected $\{K_{1,3}, X\}$-free graphs which are distinct from an odd cycle and have independence number at least $4$, and we show that all graphs in the class are perfect if and only if $X$…

In this paper, first some results of [5] are extended for subadditive separating maps between C(X;E) and C(Y;E), such that E is a unital Banach algebra. Then we give some conditions under which a strongly subadditive map has a unique fixed…

Functional Analysis · Mathematics 2015-06-02 Yousef Estaremi , Bahman Moeini

A set $Z$ of vertices of a graph $G$ is a zero forcing set of $G$ if initially labeling all vertices in $Z$ with $1$ and all remaining vertices of $G$ with $0$, and then, iteratively and as long as possible, changing the label of some…

Combinatorics · Mathematics 2016-08-03 Michael Gentner , Dieter Rautenbach

Motivated by control-affine systems in optimal control theory, we introduce the notion of a point-affine distribution on a manifold X - i.e., an affine distribution F together with a distinguished vector field contained in F. We compute…

Differential Geometry · Mathematics 2009-10-07 Jeanne N. Clelland , Christopher G. Moseley , George R. Wilkens

A fair dominating set in a graph $G$ (or FD-set) is a dominating set $S$ such that all vertices not in $S$ are dominated by the same number of vertices from $S$; that is, every two vertices not in $S$ have the same number of neighbors in…

Combinatorics · Mathematics 2011-09-07 Yair Caro , Adriana Hansberg , Michael A. Henning

We study the local behavior of the nodal sets of the solutions to elliptic quasilinear equations with nonlinear conductivity part, \begin{equation*} \operatorname{div}(A_s(x,u)\nabla u)=\operatorname{div}{\vec f}(x), \end{equation*} where…

Analysis of PDEs · Mathematics 2017-06-01 Sunghan Kim , Ki-Ahm Lee , Henrik Shahgholian

Given a graph $G=(V,E)$ and a set of vertices marked as filled, we consider a color-change rule known as zero forcing. A set $S$ is a zero forcing set if filling $S$ and applying all possible instances of the color change rule causes all…

Combinatorics · Mathematics 2023-08-16 Eric Ufferman , Nicolas Swanson

For the interpolation of graph signals with generalized shifts of a graph basis function (GBF), we introduce the concept of positive definite functions on graphs. This concept merges kernel-based interpolation with spectral theory on graphs…

Signal Processing · Electrical Eng. & Systems 2019-12-11 Wolfgang Erb

Let $\mathcal{F}$ be a family of fixed graphs and let $d$ be large enough. For every $d$-regular graph $G$, we study the existence of a spanning $\mathcal{F}$-free subgraph of $G$ with large minimum degree. This problem is well-understood…

Combinatorics · Mathematics 2016-12-12 Guillem Perarnau , Bruce Reed

Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean function $\gamma_F$ in $2n$ variables ($\gamma_F(a,b)=1$ if $a\neq{\bf 0}$ and equation $F(x)+F(x+a)=b$ has solutions) has the form $\gamma_F(a,b) = \Phi_F(a)…

Discrete Mathematics · Computer Science 2020-05-22 Anastasiya Gorodilova

For a topological space $X$ a topological contraction on $X$ is a closed mapping $f:X\to X$ such that for every open cover of $X$ there is a positive integer $n$ such that the image of the space $X$ via the $n$th iteration of $f$ is a…

General Topology · Mathematics 2026-02-04 Michał Morayne , Robert Rałowski

We resolve a 1983 question of Serre by constructing curves with many points of every genus over every finite field. More precisely, we show that for every prime power q there is a positive constant c_q with the following property: for every…

Algebraic Geometry · Mathematics 2007-05-23 Noam D. Elkies , Everett W. Howe , Andrew Kresch , Bjorn Poonen , Joseph L. Wetherell , Michael E. Zieve

Given a network of routing nodes, represented as a directed graph, we prove the following necessary and sufficient condition for the existence of deadlock-free message routing: The directed graph must contain two edge-disjoint directed…

Combinatorics · Mathematics 2025-03-07 Uri Mendlovic , Yossi Matias
‹ Prev 1 8 9 10 Next ›