Related papers: Sampling in paley-wiener spaces on combinatorial g…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We study Lie-Hamilton systems on the plane, i.e. systems of first-order differential equations describing the integral curves of a $t$-dependent vector field taking values in a finite-dimensional real Lie algebra of planar Hamiltonian…
Due to the advent of the expressions of data other than tabular formats, the topological compositions which make samples interrelated came into prominence. Analogically, those networks can be interpreted as social connections, dataflow…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
A Parseval frame is a spanning set for a Hilbert space which satisfies the Parseval identity: a vector can be expressed as a linear combination of the frame whose coefficients are inner products with the frame vectors. There is considerable…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
The use of unitary invariant subspaces of a Hilbert space $\mathcal{H}$ is nowadays a recognized fact in the treatment of sampling problems. Indeed, shift-invariant subspaces of $L^2(\mathbb{R})$ and also periodic extensions of finite…
In distributed signal processing frames play significant role as redundant building blocks. Bemrose et. al. were motivated from this concept, as a result they introduced weaving frames in Hilbert space. Weaving frames have useful…
Starting from the Mellin-Barnes integral representation of a Feynman integral depending on set of kinematic variables $z_i$, we derive a system of partial differential equations w.r.t.\ new variables $x_j$, which parameterize the…
We study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\lambda^{|I|}$, for a positive real parameter $\lambda$. For large $\lambda$, computing the partition…
A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any…
This paper introduces a general construction of self-similar metric spaces as limits of discrete graphs. Our framework produces many classical examples, such as the Sierpi\'nski carpet and the higher dimensional Menger sponges, but also a…
An end-to-end trainable ConvNet architecture, that learns to harness the power of shape representation for matching disparate image pairs, is proposed. Disparate image pairs are deemed those that exhibit strong affine variations in scale,…
A space of entire functions of several complex variables rapidly decreasing on ${\mathbb R}^n$ and such that their growth along $i{\mathbb R}^n$ is majorized with the help of a family of weight functions is considered in this paper. For…
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…