Related papers: Morphological adjunctions represented by matrices …
Integration over curved manifolds with higher codimension and, separately, discrete variants of continuous operators, have been two important, yet separate themes in harmonic analysis, discrete geometry and analytic number theory research.…
A plus-contact representation of a planar graph $G$ is called $c$-balanced if for every plus shape $+_v$, the number of other plus shapes incident to each arm of $+_v$ is at most $ c \Delta +O(1)$, where $\Delta$ is the maximum degree of…
We present an alternative geometric representation for the eleven Archimedean lattices, in which each site and bond is uniquely labeled by an ordered pair of integers and characterized via a modular function. This structured labeling…
Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…
In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hypercubes) and maturity models (total orders) to yield models of…
We give a structural characterisation of linear operators from one $C^\ast$% -algebra into another whose adjoints map extreme points of the dual ball onto extreme points. We show that up to a $\ast$-isomorphism, such a map admits of a…
We study completely contractive representations of product systems $X$ of correspondences over the semigroup $\mathbb{Z}_+^k$. We present a necessary and sufficient condition for such a representation to have a regular isometric dilation.…
Doppler-resilient complementary sequence sets (DRCSs) are crucial in modern communication and sensing systems in mobile environments. In this paper, we propose a new lower bound for the aperiodic ambiguity function (AF) of unimodular DRCSs…
A fundamental operation in many vision tasks, including motion understanding, stereopsis, visual odometry, or invariant recognition, is establishing correspondences between images or between images and data from other modalities. We present…
We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…
Let $H:M_m\to M_m$ be a holomorphic function of the algebra $M_m$ of complex $m\times m$ matrices. Suppose that $H$ is orthogonally additive and orthogonally multiplicative on self-adjoint elements. We show that either the range of $H$…
A dot-product representation of a graph is a mapping of its vertices to vectors of length $k$ so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of their corresponding vertices exceeds some threshold.…
We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…
The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. Mathematically the Graph- BLAS defines a core set of matrix-based graph operations that can…
In 2006, Arveson resolved a long-standing problem by showing that for any element $x$ of a separable self-adjoint unital subspace $S\subseteq B(H)$, $\|x\|=\sup\|\pi(x)\|$, where $\pi$ runs over the boundary representations for $S$. Here we…
In this paper we introduce min-plus low rank matrix approximation. By using min and plus rather than plus and times as the basic operations in the matrix multiplication; min-plus low rank matrix approximation is able to detect…
We show that any two frames in a separable Hilbert space that are dual to each other have the same excess. Some new relations for the analysis resp. synthesis operators of dual frames are also derived. We then prove that pseudo-dual frames…
Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensively studied by theoreticians and practitioners alike. The…
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property…
An important question is to describe topological conjugacy classes of dynamical systems. Here we show that within the space of real analytic one-dimensional maps with critical points of prescribed order, the conjugacy class of a map is a…