Related papers: Construction of Curtis-Phan-Tits system in black b…

Manin associated to a quadratic algebra (quantum space) the quantum matrix group of its automorphisms. This Talk aims to demonstrate that Manin's construction can be extended for quantum spaces which are non-quadratic homogeneous algebras.…

We give an exposition of the hidden subgroup problem for dihedral groups from the point of view of the standard hidden subgroup quantum algorithm for finite groups. In particular, we recall the obstructions for strong Fourier sampling to…

The dynamics of the subatomic fundamental particles, represented by quantum fields, and their interactions are determined uniquely by the assigned transformation properties, i.e., the quantum numbers associated with the underlying symmetry…

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

We equip Ellis and Brundan's version of the odd categorified quantum group for sl(2) with a differential giving it the structure of a graded dg-2-supercategory. The presence of the super grading gives rise to two possible…

We present a quantum algorithm for the dihedral hidden subgroup problem with time and query complexity $O(\exp(C\sqrt{\log N}))$. In this problem an oracle computes a function $f$ on the dihedral group $D_N$ which is invariant under a…

We consider the problem of deciding if a group is the fundamental group of a smooth connected complex quasi-projective (or projective) variety using Alexander-based invariants. In particular, we solve the problem for large families of…

We construct algebraic cycles in Bloch's cubical cycle group which correspond to multiple polylogarithms with generic arguments. Moreover, we construct out of them a Hopf subalgebra in the Bloch-Kriz cycle Hopf algebra. In the process, we…

We develop a graphical calculus for the microformal or thick morphisms introduced by Ted Voronov. This allows us to write the infinite series arising from pullbacks, compositions, and coordinate transformations of thick morphisms as sums…

Let C be a depth-3 circuit with n variables, degree d and top fanin k (called sps(k,d,n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically…

The $p$-group generation algorithm from computational group theory is used to obtain information about large quotients of the pro-2 group $G = \text{Gal} (k^{nr,2}/k)$ for $k = \mathbb{Q}(\sqrt{d})$ with $d = -445, -1015, -1595, -2379$. In…

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) have provided a unified framework for understanding many quantum algorithms, including factorization, matrix inversion, and Hamiltonian simulation. As a…

We associate to any convenient nondegenerate Laurent polynomial on the complex torus (C^*)^n a canonical Frobenius-Saito structure on the base space of its universal unfolding. According to the method of K. Saito (primitive forms) and of M.…

With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…

We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…

A class of special solutions are constructed in an intuitive way for the ultradiscrete analog of $q$-Painlev\'e II ($q$-PII) equation. The solutions are classified into four groups depending on the function-type and the system parameter.

We generalize the classical study of Alexander polynomials of smooth or PL locally-flat knots to PL knots that are not necessarily locally-flat. We introduce three families of generalized Alexander polynomials and study their properties.…

We construct, for q a root of unity of odd order, an embedding of the projective special linear group PSL(n) into the group of bi-Galois objects over u_q(sl(n))*, the coordinate algebra of the Frobenius-Lusztig kernel of SL(n), which is…

We develop efficient randomized algorithms to solve the black-box reconstruction problem for polynomials over finite fields, computable by depth three arithmetic circuits with alternating addition/multiplication gates, such that output gate…

We are interested in computing $k$ most preferred models of a given d-DNNF circuit $C$, where the preference relation is based on an algebraic structure called a monotone, totally ordered, semigroup $(K, \otimes, <)$. In our setting, every…