Related papers: Variational Splines and Paley--Wiener Spaces on Co…
This survey gives an overview of three central algebraic themes related to the study of splines: duality, group actions, and homology. Splines are piecewise polynomial functions of a prescribed order of smoothness on some subdivided domain…
The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…
The $p$-Laplacian for graphs, as well as the vertex Laplace operator and the hyperedge Laplace operator for the general setting of oriented hypergraphs, are generalized. In particular, both a vertex $p$-Laplacian and a hyperedge…
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda + \sum_{k = 1}^d [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are linear forms in…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
Motivated by the well-known Paley graphs over finite fields and their generalizations, in this paper we explore a natural multiplicative-additive analogue of such graphs arising from vector spaces over finite fields. Namely, if $n\ge 2$ and…
We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of topology and…
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from related data…
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…
We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…
We conjecture a geometrical form of the Paley-Wiener theorem for the Dunkl transform and prove three instances thereof, one of which involves a limit transition from Opdam's results for the graded Hecke algebra. Furthermore, the connection…
We discuss relations between uniform minimality, unconditionality and interpolation for families of reproducing kernels in backward shift invariant subspaces. This class of spaces contains as prominent examples the Paley-Wiener spaces for…
In a recent article Hasenfratz and von Allmen have suggested a fixed point action for two flavors of Weyl fermions on the lattice with gauge group SU(2). The block-spin transformation they use maps the chiral and vector symmetries of the…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…
We consider the spin-$J$ XXZ-Hamiltonian on general graphs $\mathcal{G}$ and show its equivalence to a direct sum of discrete many-particle Schr\"odinger type operators on what we call "$N$-particle graphs with maximal local occupation…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…
A new family of combined subdivision schemes with one tension parameter is proposed by the interpolatory and approximating subdivision schemes. The displacement vectors between the points of interpolatory and approximating subdivision…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
This is a short review article on invariants of spatial graphs, written for "A Concise Encyclopedia of Knot Theory" (ed. Adams et. al.). The emphasis is on combinatorial and polynomial invariants of spatial graphs, including the Alexander…