Related papers: A Kronecker algorithm for locally closed sets over…

Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em efficiently} a representative point for each connected…

This paper aims at developing a "local--global" approach for various types of finite dimensional algebras, especially those related to Hecke algebras. The eventual intention is to apply the methods and applications developed here to the…

The problem of characterizing a real polynomial $f$ as a sum of squares of polynomials on a real algebraic variety $V$ dates back to the pioneering work of Hilbert in [Mathematische Annalen 32.3 (1888): 342-350]. In this paper, we…

Given its widespread application in machine learning and optimization, the Kronecker product emerges as a pivotal linear algebra operator. However, its computational demands render it an expensive operation, leading to heightened costs in…

This paper deals with $n$-dimensional algebras, over any field, which have only trivial derivation (automorphism) and simple algebras. It is shown that the corresponding sets of algebras are not empty and, in algebraically closed field…

In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

We provide a new condition for an absolutely almost simple algebraic group to have good reduction with respect to a discrete valuation of the base field which is formulated in terms of the existence of maximal tori with special properties.…

We prove that in the geometric complexity theory program the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial determinantal complexity lower bounds for the permanent polynomial. Moreover, we prove the…

Polynomial factorization over $ZZ$ is of great historical and practical importance. Currently, the standard technique is to factor the polynomial over finite fields first and then to lift to integers. Factorization over finite fields can be…

Normalization is a fundamental ring-theoretic operation; geometrically it resolves singularities in codimension one. Existing algorithmic methods for computing the normalization rely on a common recipe: successively enlarge the given ring…

We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…

Let $K$ be a nonarchimedean local field of characteristic zero with valuation ring $R$, for instance, $K=\mathbb{Q}_p$ and $R=\mathbb{Z}_p$. We prove a general integral geometric formula for $K$-analytic groups and homogeneous $K$-analytic…

A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…

We present an algorithm which takes as input a closed semi-algebraic set, $S \subset \R^k$, defined by \[ P_1 \leq 0, ..., P_\ell \leq 0, P_i \in \R[X_1,...,X_k], \deg(P_i) \leq 2, \] and computes the Euler-Poincar\'e characteristic of $S$.…

Let $\mathcal K$ be a complete quasivariety of completely regular universal topological algebras of continuous signature $\mathcal E$ (which means that $\mathcal K$ is closed under taking subalgebras, Cartesian products, and includes all…

We survey a recent result of Koll\'{a}r about reconstructing normal, geometrically integral, projective varieties of dimension $\ge 4$ in characteristic $0$ from their underlying Zariski topological spaces.

In this article, we study the parameterized complexity of the Set Cover problem restricted to semi-ladder-free hypergraphs, a class defined by Fabianski et al. [Proceedings of STACS 2019]. We observe that two algorithms introduced by…

New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…

We study rational Cherednik algebras over an algebraically closed field of positive characteristic. We first prove several general results about category O, and then focus on rational Cherednik algebras associated to the general and special…