Related papers: The adjacency matrix and the discrete Laplacian ac…

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…

We study Jacobi matrices on trees with one end at inifinity. We show that the defect indices cannot be greater than 1 and give criteria for essential selfadjointness. We construct certain polynomials associated with matrices, which mimic…

We discuss connections between the essential self-adjointness of a symmetric operator and the constancy of functions which are in the kernel of the adjoint of the operator. We then illustrate this relationship in the case of Laplacians on…

We study the Gaffney Laplacian on a vector bundle equipped with a compatible metric and connection over a Riemannian manifold that is possibly geodesically incomplete. Under the hypothesis that the Cauchy boundary is polar, we demonstrate…

We consider a non self-adjoint Laplacian on a directed graph with non symmetric weights on edges. We give a criterion for the m-accretiveness and the m-sectoriality of this Laplacian. Our results are based on a comparison of this operator…

Morphisms between (formal) contexts are certain pairs of maps, one between objects and one between attributes of the contexts in question. We study several classes of such morphisms and the connections between them. Among other things, we…

We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…

We provide a necessary and sufficient condition for matrices in the max-plus algebra to be pseudo-diagonalizable, calculate the powers of pseudo-diagonal matrices and prove the invariance of optimal-node matrices and separable matrices…

We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We give necessary conditions for this Laplacian to be sectorial. We introduce a special self-adjoint operator and compare its essential spectrum…

Cutting out and object and estimate its transparency mask is a key task in many applications. We take on the work on closed-form matting by Levin et al., that is used at the core of many matting techniques, and propose an alternative…

The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…

In discrete signal and image processing, many dilations and erosions can be written as the max-plus and min-plus product of a matrix on a vector. Previous studies considered operators on symmetrical, unbounded complete lattices, such as…

We study the relationship between cartesian bicategories and a specialisation of Lawvere's hyperdoctrines, namely elementary existential doctrines. Both provide different ways of abstracting the structural properties of logical systems: the…

We study adjacency of equisingularity types of planar curve singularities in terms of their Enriques diagrams. For linear adjacency a complete answer is obtained, whereas for arbitrary (analytic) adjacency a necessary condition and a…

We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…

We provide a thorough algebraic analysis of three known completions having a central role in the exact completions of Lawvere's doctrines: the one adding comprehensive diagonals (i.e. forcing equality on terms to coincide with the equality…

A natural and very important development of constrained system theory is a detail study of the relation between the constraint structure in the Hamiltonian formulation with specific features of the theory in the Lagrangian formulation,…

This short survey reviews some aspects of spaces of positive-definite self-adjoint linear transformations on R^n and on C^n, including the standard Riemannian metric and the relation with the exponential mapping acting on self-adjoint…

We review and study the correspondence between discrete linear lattice/chain models of interacting particles and their continuous counterparts represented by linear partial differential equations. In particular, we study the correspondence…