Related papers: Generalized Splines and Graphic Arrangements
Current applications have produced graphs on the order of hundreds of thousands of nodes and millions of edges. To take advantage of such graphs, one must be able to find patterns, outliers and communities. These tasks are better performed…
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
In these introductory lectures we discuss classes of presently known nested sums, associated iterated integrals, and special constants which hierarchically appear in the evaluation of massless and massive Feynman diagrams at higher loops.…
The spline space $C_k^r(\Delta)$ attached to a subdivided domain $\Delta$ of $\R^{d} $ is the vector space of functions of class $C^{r}$ which are polynomials of degree $\le k$ on each piece of this subdivision. Classical splines on planar…
The minimum number of bicliques needed to cover the edge set of the complete graph on $n$ vertices is $\lceil \log_2 n \rceil$. The Graham-Pollak theorem states that at least $n-1$ bicliques are required to partition the edge set of the…
Graph clustering aims at discovering a natural grouping of the nodes such that similar nodes are assigned to a common cluster. Many different algorithms have been proposed in the literature: for simple graphs, for graphs with attributes…
Hypergraphs have seen widespread application in network and data science communities in recent years. We present a survey of recent work to construct auxiliary structures from hypergraphs -- specifically simplicial, relative, and chain…
A graph is said to be $\mathcal{H}(n, \Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. Using a `matching-based' embedding technique introduced by Alon and F\"uredi, Dellamonica, Kohayakawa,…
Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…
Probabilistic relaxations of graph cuts offer a differentiable alternative to spectral clustering, enabling end-to-end and online learning without eigendecompositions, yet prior work centered on RatioCut and lacked general guarantees and…
A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…
We generalize the notion of quasielliptic curves, which have infinitesimal symmetries and exist only in characteristic two and three, to a remarkable hierarchy of regular curves having infinitesimal symmetries, defined in all…
Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…
The notion of regular cell complexes plays a central role in topological combinatorics because of its close relationship with posets. A generalization, called totally normal cellular stratified spaces, was introduced by the third author by…
We introduce a generalization of the celebrated Lov\'asz theta number of a graph to simplicial complexes of arbitrary dimension. Our generalization takes advantage of real simplicial cohomology theory, in particular combinatorial…
For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
The fundamental group of the complement of a hyperplane arrangement plays an important role in studying the corresponding arrangements. In particular, for large families of hyperplane arrangements, this fundamental group, being isomorphic…