Related papers: Sampling in paley-wiener spaces on combinatorial g…
In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal.…
Graphical models have been popularly used for capturing conditional independence structure in multivariate data, which are often built upon independent and identically distributed observations, limiting their applicability to complex…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
The concept of diagrammatic combinatorial Hopf algebras in the form introduced for describing the Heisenberg-Weyl algebra in~\cite{blasiak2010combinatorial} is extended to the case of so-called rule diagrams that present graph rewriting…
A celebrated theorem of Hadwiger states that the Euler-Poincar\'e characteristic is the the unique invariant and continuous valuation on the distributive lattice of compact polyhedra in R^n that assigns value one to each convex non-empty…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…
Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…
This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…
An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
A wavelet is a special case of a vector in a separable Hilbert space that generates a basis under the action of a collection, or system, of unitary operators. We will describe the operator-interpolation approach to wavelet theory using the…
In this paper, we exhibit the equivalence between different notions of unique range sets, namely, unique range sets, weighted unique range sets and weak-weighted unique range sets under certain conditions.\par Also, we present some…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
In this paper, we consider the problem of recovering a compactly supported multivariate function from a collection of pointwise samples of its Fourier transform taken nonuniformly. We do this by using the concept of weighted Fourier frames.…
In this note we present some abstract ideas how one can construct spaces from building blocks according to a graph. The coupling is expressed via boundary pairs, and can be applied to very different spaces such as discrete graphs, quantum…
In this paper we address the problem of estimating the operator norm of the embeddings between multidimensional weighted Paley-Wiener spaces. These can be equivalently thought as Fourier uncertainty principles for bandlimited functions. By…
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We establish a regular sampling theory in the range of the analysis operator of a continuous frame having a unitary structure. The unitary structure is related with a unitary representation of a locally compact abelian group on a separable…