Related papers: Fixed points of Boolean networks, guessing graphs,…

Let $\mathcal{A}_n^k$ denote all nonbounding effective smooth $({\Bbb Z}_2)^k$-actions on $n$-dimensional smooth closed connected manifolds, each of which is cobordant to one with finite fixed set. Motivated by GKM theory, one can associate…

Stationary points or derivative zero crossings of a regression function correspond to points where a trend reverses, making their estimation scientifically important. Existing approaches to uncertainty quantification for stationary points…

In this article, we derive a common fixed point result for a pair of single valued and set-valued mappings on a metric space having graphical structure. In this case, the set-valued map is assumed to be closed valued instead of closed and…

Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…

Let $M$ be a nilmanifold with a fundamental group which is free $2$-step nilpotent on at least 4 generators. We will show that for any nonnegative integer $n$ there exists a self-diffeomorphism $h_n$ of $M$ such that $h_n$ has exactly $n$…

Up to switching isomorphism there are six ways to put signs on the edges of the Petersen graph. We prove this by computing switching invariants, especially frustration indices and frustration numbers, switching automorphism groups,…

Signed networks provide a principled framework for representing systems in which interactions are not merely present or absent but qualitatively distinct: friendly or antagonistic, supportive or conflicting, excitatory or inhibitory. This…

In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…

Many real-world applications give rise to large heterogeneous networks where nodes and edges can be of any arbitrary type (e.g., user, web page, location). Special cases of such heterogeneous graphs include homogeneous graphs, bipartite,…

Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…

The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…

Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-free graphs with matching number at most $s$. For fixed $F$ and $s$, we determine this number apart from a constant additive term. We also…

This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…

The topic of fixed points in digital metric spaces continues to draw publications with assertions that are incorrect, incorrectly proven, trivial, or incoherently stated. We continue the work of our earlier papers that discuss publications…

We obtain a general lower bound for the number of fixed points of a circle action on a compact almost complex manifold $M$ of dimension $2n$ with nonempty fixed point set, provided the Chern number $c_1c_{n-1}[M]$ vanishes. The proof…

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

In this paper, we investigate the existence and uniqueness of fixed points for self-mappings defined on bipolar metric spaces using a new class of contractive conditions, namely polynomial-type contractions. Our main results establish…