Related papers: Construction of long root SL(2,q)-subgroups in bla…

This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…

We characterize those finite groups for which the bounded derived category of finite dimensional representations over an algebraically closed field of characteristic $p$ has distributive lattice of thick subcategories: they are precisely…

We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…

The results of computer computations determining the automorphism groups of the groups of order 32$p$ for $p \geq 3$ are given in several tables. Presentations for the automorphism groups of the groups of order 32, which in many cases…

The mapping class group $M(X)$ of a smooth manifold $X$ is the group of smooth isotopy classes of orientation preserving diffeomorphisms of $X$. We prove a number of results about the mapping class groups of compact, simply-connected,…

We study automorphisms and representations of quasi polynomial algebras (QPAs) and quasi Laurent polynomial algebras (QLPAs). For any QLPA defined by an arbitrary skew symmetric integral matrix, we explicitly describe its automorphism…

Let $f$ be an irreducible polynomial of prime degree $p\geq 5$ over $\QQ$, with precisely $k$ pairs of complex roots. Using a result of Jens H\"{o}chsmann (1999), we show that if $p\geq 4k+1$ then $\Gal(f/\QQ)$ is isomorphic to $A_{p}$ or…

Using the mixed Lie algebras of Lazard, we extend the results of the first author on mild groups to the case p=2. In particular, we show that for any finite set S_0 of odd rational primes we can find a finite set S of odd rational primes…

The multiscale Monte-Carlo algorithm outlined in Bai and Brandt[1] is applied to a simple model of the polypeptide backbone. Effective coarse level Hamiltonians are derived by a fast Newtonian iterative scheme. The coarse Hamiltonian…

We discuss theoretical and algorithmic questions related to the $p$-curvature of differential operators in characteristic $p$. Given such an operator $L$, and denoting by $\Chi(L)$ the characteristic polynomial of its $p$-curvature, we…

We formulate the Root Extraction problem in finite Abelian $p$-groups and then extend it to generic finite Abelian groups. We provide algorithms to solve them. We also give the bounds on the number of group operations required for these…

We examine the two parameter deformed superalgebra $U_{qs}(sl(1|2))$ and use the results in the construction of quantum chain Hamiltonians. This study is done both in the framework of the Serre presentation and in the $R$-matrix scheme of…

Straight-line programs are a central tool in several areas of computer science, including data compression, algebraic complexity theory, and the algorithmic solution of algebraic equations. In the algebraic setting, where straight-line…

We show that the unrestricted black-box complexity of the $n$-dimensional XOR- and permutation-invariant LeadingOnes function class is $O(n \log (n) / \log \log n)$. This shows that the recent natural looking $O(n\log n)$ bound is not…

We study $L^p$-theory of second-order elliptic divergence type operators with complex measurable coefficients. The major aspect is that we allow complex coefficients in the main part of the operator, too. We investigate generation of…

A new class of test functions for black box optimization is introduced. Affine OneMax (AOM) functions are defined as compositions of OneMax and invertible affine maps on bit vectors. The black box complexity of the class is upper bounded by…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finite $p$-group of class 2. We discuss an example at the end.

In his paper "A Construction for Coisotropic Subalgebras of Lie Bialgebras", Marco Zambon gave a way to use a long root of a complex semisimple Lie biaglebra $\mathfrak{g}$ to construct a coisotropic subalgebra of $\mathfrak{g}$. In this…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…