Related papers: Some notes about matrices, 2
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of…
Approximate lattices are aperiodic generalisations of lattices of locally compact groups that were first studied in seminal work of Yves Meyer. They are defined as those uniformly discrete approximate subgroups (symmetric subsets stable…
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 review various combinatorial applications of field theoretical and matrix model approaches to equilibrium statistical physics involving the enumeration of fixed and random lattice model configurations. We show how the structures of the…
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…
The aim of this note is to characterize those doubly ordered frames $\langle X, \leq_1, \leq_2 \rangle$ which are embeddable into the canonical frame of its Urquhart complex algebra.
We review the state of the art of the theory of Euclidean random matrices, focusing on the density of their eigenvalues. Both Hermitian and non-Hermitian matrices are considered and links with simpler, standard random matrix ensembles are…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…
Why is it that after so many years matrices continue to play such an important roll in Physics and mathematics? Is there a geometric way of looking at matrices, and linear transformations in general, that lies at the roots of their success?…
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…
Lectures notes (in italian) of some arguments of classical analysis, with exercises. A particular emphasis to functional analysis and elementary operator algebra theory is given, by means of exercises and examples.
Here we consider a few topics related to Lipschitz classes for functions and curves in metric spaces.
Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of…
Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\vee$-generated lattices. The lattice of flats, defined for…
The following work is an exploration into certain topics in the broad world of integrable models, both classical and quantum, and consists of two main parts of roughly equal length. The first part, consisting of chapters 1-3, concerns…
Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave in a similar, although non equivalent, way.…
Differentiable structure ensures that many of the basics of classical convex analysis extend naturally from Euclidean space to Riemannian manifolds. Without such structure, however, extensions are more challenging. Nonetheless, in…
We study the multiplicative lattices L which satisfy the condition a = (a : (a : b))(a : b) for all a,b in L.
We introduce the notion of a genus and its mass for vertex algebras. For lattice vertex algebras, their genera are the same as those of lattices, which plays an important role in the classification of lattices. We derive a formula relating…