Related papers: A Well-Defined Jellyfish Algorithm for the Affine …
We investigate the notions of \emph{localization} and \emph{filtration} in the context of extended affine Lie algebras. Our primary objective is to develop a localization theory that facilitates the construction of meaningful local…
Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class…
Let $\mathbb{F}$ be an arbitrary field. In this paper, we continue studying the Terwilliger algebras of association schemes over $\mathbb{F}$ that were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [8]. We determine…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
While efficient randomized algorithms for factorization of polynomials given by algebraic circuits have been known for decades, obtaining an even slightly non-trivial deterministic algorithm for this problem has remained an open question of…
We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…
On a smooth algebraic variety over $\mathbb{C}$, we build the tempered subanalytic and Stein tempered subanalytic sites. We construct the sheaf of holomorphic functions tempered at infinity over these sites and study their relations with…
When we try to solve a system of linear equations, we can consider a simple iterative algorithm in which an equation including only one variable is chosen at each step, and the variable is fixed to the value satisfying the equation. The…
There has been recent interest in novel Clifford geometric invariants of linear transformations. This motivates the investigation of such invariants for a certain type of geometric transformation of interest in the context of root systems,…
The weak Jacobi forms of integral weight and integral index associated to an even positive definite lattice form a bigraded algebra. In this paper we prove a criterion for this type of algebra being free. As an application, we give an…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
Lie-theoretic structures of type $E_8$ (e.g., Lie groups and algebras, Hecke algebras and Kazhdan-Lusztig cells, ...) are considered to serve as a `gold standard' when it comes to judging the effectiveness of a general algorithm for solving…
For a hypergraph $\mathcal{H}=(X,\mathcal{E})$ a \emph{support} is a graph $G$ on $X$ such that for each $E\in\mathcal{E}$, the induced subgraph of $G$ on the elements in $E$ is connected. If $G$ is planar, we call it a planar support. A…
Let $R$ be a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$, and suppose $q+q^{-1}$ is invertible in $R$. For each planar surface $\Sigma_{0,n+1}$, we present its Kauffman bracket skein algebra over $R$ by…
We give an identification between the planar algebra of the subgroup-subfactor $R \rtimes H \subset R \rtimes G$ and the $G$-invariant planar subalgebra of the planar algebra of the bipartite graph $\star_n$, where $n = [G : H]$. The…
We propose an algorithm for solving nonlinear convex programs defined in terms of a symmetric positive semidefinite matrix variable $X$. This algorithm rests on the factorization $X=Y Y^T$, where the number of columns of Y fixes the rank of…
The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstein [SODA 95, J'GAA 99] gives the first linear time algorithm for…
We give the classification of subfactor planar algebras at index exactly 5. All the examples arise as standard invariants of subgroup subfactors. Some of the requisite uniqueness results come from work of Izumi in preparation. The…
We consider non-degenerate graph immersions into affine space $\mathbb A^{n+1}$ whose cubic form is parallel with respect to the Levi-Civita connection of the affine metric. There exists a correspondence between such graph immersions and…
In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic…