Related papers: On the field intersection problem of solvable quin…
We study the set of common $\mathbb{F}_q$-rational solutions of "smooth" systems of multivariate symmetric polynomials with coefficients in a finite field $\mathbb{F}_q$. We show that, under certain conditions, the set of common solutions…
In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.
We study in detail the general solution for a scalar field cosmology with an exponential potential, correcting some imprecisions, encountered previously in the literature. In addition, we generalize this solution for a piecewise exponential…
For an arbitrary $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ we study the problem of finding those $q$-polynomials $g$ over $\mathbb{F}_{q^n}$ for which the image sets of $f(x)/x$ and $g(x)/x$ coincide. For $n\leq 5$ we provide sufficient…
The purpose of this talk is to present an (apparently) new way to look at the intersection complex of a singular variety over a finite field, or, more generally, at the intermediate extension functor on pure perverse sheaves, and an…
We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…
Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…
In this paper, we study the polynomial Gauss sums over finite fields, and present an analogue of Davenport-Hasse's theorem for the entire polynomial Gauss sums, which is a generalization of the previous result obtained by Hayes.
Let $H$ be a skew field of finite dimension over its center $k$. We solve the Inverse Galois Problem over the field of fractions $H(X)$ of the ring of polynomial functions over $H$ in the variable $X$, if $k$ contains an ample field.
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…
We review an exact WKB resolution method for the stationary 1D Schr\"odinger equation with a general polynomial potential. This contribution covers already published material: we supply a commented summary here, stressing a few aspects…
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…
Using higher order intertwining operators we obtain new exactly solvable potentials admitting quasinormal mode (QNMs) solutions of the Klein-Gordon equation. It is also shown that different potentials exhibiting QNMs can be related through…
We give an effective solution of the conjugacy problem for two by two matrices over the polynomial ring in one variable over a finite field.
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…
We give explicit formulas as well as a quadratic time algorithm to solve (so called) generalized Vandermonde's systems of p linear equations and n variables. It allows in particular to find all (so called Lagrange's) interpolation polynoms…
We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and…
We examine various generalizations, e.g. exactly solvable, quasi-exactly solvable and non-Hermitian variants, of a quantum nonlinear oscillator. For all these cases, the same mass function has been used and it has also been shown that the…
We study a group of new methods to solve an open problem that is the shortest paths problem on a given fix-weighted instance. It is the real significance at a considerable altitude to reach our aim to meet these qualities of generic,…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…