Related papers: Factorization of polynomials in hyperbolic geometr…

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

We compute the $p$-adic densities of points with a given splitting type along a (generically) finite map, analogous to the classical Chebotarev theorem over number fields and function fields. Under some mild hypotheses, we prove that these…

For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of H contains some member of F as a spanning subgraph.While it…

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…

Based on the computation of a superset of the implicit support, implicitization of a parametrically given hyper-surface is reduced to computing the nullspace of a numeric matrix. Our approach exploits the sparseness of the given parametric…

We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

In this paper, we construct mock Alexander polynomials for starred links and linkoids in surfaces. These polynomials are defined as specific sums over states of link or linkoid diagrams that satisfy $f=n$, where $f$ denotes the number of…

We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…

We present an algorithmic proof of the Cartan-Dieudonn\'e theorem on generalized real scalar product spaces with arbitrary signature. We use Clifford algebras to compute the factorization of a given orthogonal transformation as a product of…

We classify all the non-hyperbolic Dehn fillings of the complement of the chain-link with 3 components, conjectured to be the smallest hyperbolic 3-manifold with 3 cusps. We deduce the classification of all non-hyperbolic Dehn fillings of…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

We describe completely the link invariants constructed using Markov traces on the Yokonuma-Hecke algebras in terms of the linking matrix and the HOMFLYPT polynomials of sublinks.

Let $ R $ be a regular local ring with maximal ideal $ \mathfrak{m} $. We consider elements $ f \in R $ such that their Newton polyhedron has a loose edge. We show that if the symbolic restriction of $f$ to such an edge is a product of two…

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\}$,…

Blackbox algorithms for linear algebra problems start with projection of the sequence of powers of a matrix to a sequence of vectors (Lanczos), a sequence of scalars (Wiedemann) or a sequence of smaller matrices (block methods). Such…

We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.