Related papers: The hit problem for the polynomial algebra of four…

We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.

In this paper we define a two-variable, generic Hecke algebra, H, for each complex reflection group G(b,1,n). The algebra H specializes to the group algebra of G(b,1,n) and also to an endomorphism algebra of a representation of GL(n,q)…

Let $\widehat G \subseteq G$ be complex reductive algebraic groups. The branching problem that aims to study $G$-modules as $\widehat G$-modules is encoded by a collection of branching multiplicities parameterised by pairs of dominant…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

We find the minimal dimension for a truncated polynomial algebra over an arbitrary field for which there exists a "non-thin" subalgebra. Moreover, we discuss examples of subalgebras, and count them in low dimensions.

We compute the action of the Steenrod algebra on generators of algebras of invariants of special linear group ${SL_n=SL(n,\mathbb Z/p)}$ in the polynomial algebra with $ p$ an odd prime number.

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

Let $I \subset R = \mathbb{F}[x_1,x_2]$ be a height two ideal minimally generated by three homogeneous polynomials of the same degree $d$, where $\mathbb{F}$ is a field of characteristic zero. We use the theory of $D$-modules to deduce…

We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…

We describe explicitly the algebra of polynomial functions on the Hilbert space of four qubit states which are invariant under the SLOCC group $SL(2,{\mathbb C})^{4}$. From this description, we obtain a closed formula for the…

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…

This note aims at finding explicit and efficient generation of ideals in subalgebras $R$ of the polynomial ring $S=k[t]$ ($k$ a field) such that $t^{c_0}S \subseteq R$ for some integer $c_0 > 0$. The class of these subalgebras which we call…

It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To…

In this paper, we devise two algorithms for the problem of testing $q$-monomials of degree $k$ in any multivariate polynomial represented by a circuit, regardless of the primality of $q$. One is an $O^*(2^k)$ time randomized algorithm. The…

This article investigates the splitting problem for finitely generated projective modules $P$ over affine algebras over algebraically closed fields and their polynomial extensions. We then address an open question due to M. Roitman on monic…

Finding inclusion-minimal "hitting sets" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic…

Fixed point subalgebras of finite dimensional factor algebras of algebras of polynomials in n indeterminates over the finite field $\mathbb F_2$ (with respect to all $\mathbb F_2$-algebra automorphisms) are fully described.

We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…