Related papers: Algebraic Obstructions and the Collapse of Element…

The number of spanning trees of a graph $G$ is called the {\em complexity} of $G$ and is denoted $c(G)$. Let C(n) denote the {\em (binary) hypercube} of dimension $n$. A classical result in enumerative combinatorics (based on explicit…

It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying…

Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…

Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley-Menger ideal for $n$ points in 2D. We…

We investigate a (potentially infinite) series of subfactors, called $3^n$ subfactors, including $A_4$, $A_7$, and the Haagerup subfactor as the first three members corresponding to $n=1,2,3$. Generalizing our previous work for odd $n$, we…

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…

In this thesis we studied the structure coefficients and especially their dependence on $n$ in the case of a sequence of double-class algebras. The first chapter is dedicated to the study of the structure coefficients in the general cases…

We study two long-standing conjectures concerning lower bounds for the Betti numbers of a graded module over a polynomial ring. We prove new cases of these conjectures in codimensions five and six by reframing the conjectures as arithmetic…

A Kronecker coefficient is the multiplicity of an irreducible representation of a finite group $G$ in a tensor product of irreducible representations. We define Kronecker Hecke algebras and use them as a tool to study Kronecker coefficients…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…

We study the possibility of scaling down algorithmic information quantities in tuples of correlated strings. In particular, we address a question raised by Alexander Shen: whether, for any triple of strings $(a, b, c)$, there exists a…

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…

This paper establishes several fundamental structural properties of the $q$-Heisenberg algebra $\mathfrak{h}_n(q)$, a quantum deformation of the classical Heisenberg algebra. We first prove that when $q$ is not a root of unity, the global…

Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…

Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic…

We prove under the Bombieri-Lang conjecture for surfaces that there is an absolute bound on the length of sequences of integer squares with constant second differences, for sequences which are not formed by the squares of integers in…