Related papers: On enumerating extensions of p-adic fields with gi…
The recent work by Marcus, Spielman and Srivastava proves the existence of bipartite Ramanujan (multi)graphs of all degrees and all sizes. However, that paper did not provide a polynomial time algorithm to actually compute such graphs.…
We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…
The $L$-function of exponential sums associated to the generic polynomial of degree $d$ in $n$ variables over a finite field of characteristic $p$ is studied. A polygon called the Frobenius polygon of the generic polynomial of degree $d$ in…
We consider the cohomology groups of line bundles $\mathcal{L}$ on the \emph{incidence correspondence}, that is, a general hypersurface $X \subset \mathbb{P}^{n-1} \times \mathbb{P}^{n-1}$ of degrees $(1,1)$. Whereas the characteristic $0$…
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
This work presents author's explicit methods of constructing abelian extensions of complete discrete valuation fields. His approach to explicit equations of a cyclic extension of degree p^n which contains a given cyclic extension of degree…
We prove a general version of the "Stability Theorem": if $K$ is a valued field such that the ramification theoretical defect is trivial for all of its finite extensions, and if $F|K$ is a finitely generated (transcendental) extension of…
In the present work, we determine explicitly the genus of any separable cubic extension of any global function field given the minimal polynomial of the extension. We give algorithms computing the ramification data and the genus of any…
We generalize the Gaffney-Lazarsfeld theorem on higher ramification loci of branched coverings of $\mathbb{P}^n$ to homogeneous spaces with Picard number one.
Ramification theory of monogenic extensions of complete discrete valuation fields is presented. Relations to Kato's conductor are discussed.
In this paper, we give a fermionic p-adic integral representions of Benstein polynomials associated with Euler numbers and polynomials. Finally, we give some interesting identities for the Euler numbers by using the properties of our…
We realize infinitely many covering groups $2.A_n$ (where $A_n$ is the alternating group) as the Galois group of everywhere unramified Galois extensions over infinitely many quadratic number fields. After several predecessor works…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
We prove that the density of polynomials $P(x)=\sum_{i=0}^n a_n x^n$ over a local field $K$ generating an \'etale extension with specified splitting type is a rational function in terms of the size of the residue field of $K$ in the case…
M. Levine proved an enrichment of the classical Riemann-Hurwitz formula to an equality in the Grothendieck-Witt group of quadratic forms. In its strongest form, Levine's theorem includes a technical hypothesis on ramification relevant in…
This PhD deals with the notion of pseudo algebraically closed (PAC) extensions of fields. It develops a group-theoretic machinery, based on a generalization of embedding problems, to study these extensions. Perhaps the main result is that…
We develop a theory of $p$-adic continued fractions for a quaternion algebra $B$ over $\mathbb Q$ ramified at a rational prime $p$. Many properties holding in the commutative case can be proven also in this setting. In particular, we focus…
We introduce a new method of constructing complete sequences of key polynomials for simple extensions of tame fields. In our approach the key polynomials are taken to be the minimal polynomials over the base field of suitably constructed…
A method of constructing finite $p$-adic Sylvester expansions for all rationals is presented. This method parallels the classical Fibonacci-Sylvester (greedy) algorithm by iterating a $p$-adic division algorithm. The method extends to…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…