Related papers: On strict proto-differentiability of set-valued ma…
We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…
This Note gives conditions that must be imposed to algebraic multilevel discretizations involving at the same time nodal and edge elements so that a gradient-prolongation commutativity condition will be satisfied; this condition is very…
The necessary and sufficient conditions for a function to be totally or partially separable are derived. It is shown that a function is totally separable if and only if each component of the gradient vector of depends only on the…
We study properties of strongly separately continuous mappings defined on subsets of products of topological spaces equipped with the topology of pointwise convergence. In particular, we give a necessary and sufficient condition for a…
We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…
The presence of second-order smoothness for objective functions of optimization problems can provide valuable information about their stability properties and help us design efficient numerical algorithms for solving these problems. Such…
We prove that the graph of a continuous function $f$, defined on a domain of ${\mathbb C}^n$, is pluripolar if and only if $f$ is holomorphic.
A new notion of metric differentiability of set-valued functions at a point is introduced in terms of right and left limits of special set-valued metric divided differences of first order. A local metric linear approximant of a metrically…
Multivariable, real-valued functions induce matrix-valued functions defined on the space of d-tuples of n-times-n pairwise-commuting self-adjoint matrices. We examine the geometry of this space of matrices and conclude that the best notion…
The MULTICUT problem, given a graph G, a set of terminal pairs T={(s_i,t_i) | 1 <= i <= r} and an integer p, asks whether one can find a cutset consisting of at most p non-terminal vertices that separates all the terminal pairs, i.e., after…
This paper is devoted to the study of generalized differentiation properties of the infimal convolution. This class of functions covers a large spectrum of nonsmooth functions well known in the literature. The subdifferential formulas…
This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…
A classical result of variational analysis, known as Attouch theorem, establishes the equivalence between epigraphical convergence of a sequence of proper convex lower semicontinuous functions and graphical convergence of the corresponding…
For any given graph $H$, one may define a natural corresponding functional $\|.\|_H$ for real-valued functions by using homomorphism density. One may also extend this to complex-valued functions, once $H$ is paired with a $2$-edge-colouring…
As an application of Brouwer's fixed-point theorem we prove that a continuously differentiable convex function with gradient of constant norm is an affine mapping. It is a first-order characterization of affine mappings among continuously…
This paper focuses on spectral graph convolutional neural networks (ConvNets), where filters are defined as elementwise multiplication in the frequency domain of a graph. In machine learning settings where the dataset consists of signals…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
We analyze invariant measures of two coupled piecewise linear and everywhere expanding maps on the synchronization manifold. We observe that though the individual maps have simple and smooth functions as their stationary densities, they…
A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1 ,lambda_2, m, n) if its vertex set can be partitioned into m classes of size n, such that any two different vertices from the same class have…
We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…