Related papers: Noncommutative Valiant's Classes: Structure and Co…

In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

We explore a relationship between the classical representation theory of a complex, semisimple Lie algebra \g and the resonance varieties R(V,K)\subset V^* attached to irreducible \g-modules V and submodules K\subset V\wedge V. In the…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

We describe recent work on preprojective algebras and moduli spaces of their representations. We give an analogue of Kac's Theorem, characterizing the dimension types of indecomposable coherent sheaves over weighted projective lines in…

A complete flag in $\mathbb{R}^n$ is a sequence of nested subspaces $V_1 \subset \cdots \subset V_{n-1}$ such that each $V_k$ has dimension $k$. It is called totally nonnegative if all its Pl\"ucker coordinates are nonnegative. We may view…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

We analyze the proof by Lehnert and Schweitzer that the word problem of the Thompson group V is co-context-free, and we show that this word problem is the complement of the cyclic closure of a union of reverse deterministic context-free…

Arithmetic circuit complexity studies the complexity of computing polynomials using only arithmetic operations such as addition, multiplication, subtraction, and division. Polynomials over rings of integers model counting problems.…

For an ordinal $\alpha$, $\sf PEA_{\alpha}$ denotes the class of polyadic equality algebras of dimension $\alpha$. We show that for several classes of algebras that are reducts of $\PEA_{\omega}$ whose signature contains all substitutions…

We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic…

We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…

For an algebraically closed field $K$, we investigate a class of noncommutative $K$-algebras called connected quantized Weyl algebras. Such an algebra has a PBW basis for a set of generators $\{x_1,\dots,x_n\}$ such that each pair satisfies…

The Weil representation of the symplectic group associated to a finite abelian group of odd order is shown to have a multiplicity-free decomposition. When the abelian group is p-primary, the irreducible representations occurring in the Weil…

I propose a class of non-positional numeral systems where numbers are represented by Dyck words, with the systems arising from a recursive extension of prime factorization. After describing two proper subsets of the Dyck language capable of…

In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for…

In a companion paper it was shown that the class of constant-depth determinate k-ary recursive clauses is efficiently learnable. In this paper we present negative results showing that any natural generalization of this class is hard to…

Ball's complex plank theorem states that if $v_1,\dots,v_n$ are unit vectors in $\mathbb{C}^d$, and $t_1,\dots,t_n$, non-negative numbers satisfying $\sum_{k=1}^nt_k^2 = 1,$ then there exists a unit vector $v$ in $\mathbb{C}^d$ for which…

We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…

Let V be a complex vector space with basis {x_1,x_2,...,x_n} and G be a finite subgroup of GL(V). The tensor algebra T(V) over the complex is isomorphic to the polynomials in the non-commutative variables x_1, x_2,..., x_n with complex…