Related papers: A Simple Sub-Polynomial Degree Coboundary Expander

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Discrete dynamical systems defined by the iteration of a polynomial map of the unit simplex to itself appear in the context of population genetic systems evolving under mutation, recombination and weak selection. Although exceptional…

This doctoral thesis covers several topics related to the construction and study of maximal determinant matrices with complex entries. The first three chapters are devoted to number-theoretic tools to prove the non-solvability of Gram…

Comtrans algebras, arising in web geometry, have two trilinear operations, commutator and translator. We determine a Gr\"obner basis for the comtrans operad, and state a conjecture on its dimension formula. We study multilinear polynomial…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

We define $k$-dimensional digraphs and initiate a study of their spectral theory. The $k$-dimensional digraphs can be viewed as generating graphs for small categories called $k$-graphs. Guided by geometric insight, we obtain several new…

The notion of hidden symmetry algebra used in the context of exactly solvable systems is re-examined from the purely algebraic way, analyzing subspaces of commuting polynomials that generate finite-dimensional quadratic algebras. By…

Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…

A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

High-dimensional expanders are a generalization of the notion of expander graphs to simplicial complexes and give rise to a variety of applications in computer science and other fields. We provide a general tool to construct families of…

We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…

We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs; in particular we draw heavily from the topic of dominating sets. Through…

We consider hypergraph network design problems where the goal is to construct a hypergraph that satisfies certain connectivity requirements. For graph network design problems where the goal is to construct a graph that satisfies certain…

This paper introduces the notion of local spectral expansion of a simplicial complex as a possible analogue of spectral expansion defined for graphs. We show the condition of local spectral expansion has several nice implications. For…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…