Related papers: On strict proto-differentiability of set-valued ma…
The present paper is intended to provide the basis for the study of weakly differentiable functions on rectifiable varifolds with locally bounded first variation. The concept proposed here is defined by means of integration by parts…
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
This work is concerned with the prime factor decomposition (PFD) of strong product graphs. A new quasi-linear time algorithm for the PFD with respect to the strong product for arbitrary, finite, connected, undirected graphs is derived.…
The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…
We prove a special case of a dynamical analogue of the classical Mordell-Lang conjecture. In particular, let $\phi$ be a rational function with no superattracting periodic points other than exceptional points. If the coefficients of $\phi$…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
We consider the problem of discretizing one-dimensional, real-valued functions as graphs. The goal is to find a small set of points, from which we can approximate the remaining function values. The method for approximating the unknown…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
In 2023 in (3), Uwe finds the explicit form of the map which is which is settled in ZN of finite functional degree and14 discusses how to compute its usual degree w.r.t to the derivative in the linear form, i.e. the product of ones formed…
The radically synthetic foundation for smooth geometry formulated in [Law11] postulates a space T with the property that it has a unique point and, out of the monoid T^T of endomorphisms, it extracts a submonoid R which, in many cases, is…
This article is devoted to the analysis of necessary and/or sufficient conditions for metric regularity in terms of Demyanov-Rubinov-Polyakova quasidifferentials. We obtain new necessary and sufficient conditions for the local metric…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
Symmetrically self-similar graphs are an important type of fractal graph. Their Green functions satisfy order one iterative functional equations. We show when the branching number of a generating cell is two, either the graph is a star…
We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…
In this work we classify the at-point regularities of set-valued mappings into two categories and then we analyze their relationship through several implications and examples. After this theoretical tour, we use the subregularity properties…
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
In reliable decision-making systems based on machine learning, models have to be robust to distributional shifts or provide the uncertainty of their predictions. In node-level problems of graph learning, distributional shifts can be…
We prove that if $G$ and $H$ are primitive strongly regular graphs with the same parameters and $\varphi$ is a homomorphism from $G$ to $H$, then $\varphi$ is either an isomorphism or a coloring (homomorphism to a complete subgraph).…