English
Related papers

Related papers: On parametric and generic polynomials with one par…

200 papers

Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the parameterized complexity of the following problems parameterized by $k$: (1) Given a graph $G$, a clique modulator $D$ (a clique modulator is a set of vertices, whose…

Data Structures and Algorithms · Computer Science 2019-07-30 Gregory Gutin , Diptapriyo Majumdar , Sebastian Ordyniak , Magnus Wahlström

This paper extends the study of rank-metric codes in extension fields $\mathbb{L}$ equipped with an arbitrary Galois group $G = \mathrm{Gal}(\mathbb{L}/\mathbb{K})$. We propose a framework for studying these codes as subspaces of the group…

Information Theory · Computer Science 2020-06-26 Daniel Augot , Alain Couvreur , Julien Lavauzelle , Alessandro Neri

We study the category of $\mathbf{P}$-equivariant modules over the infinite variable polynomial ring, where $\mathbf{P}$ denotes the subgroup of the infinite general linear group $\mathbf{GL}(\mathbf{C}^\infty)$ consisting of elements…

Commutative Algebra · Mathematics 2024-07-04 Teresa Yu

We start from a parametrized system of $d$ generalized polynomial equations (with real exponents) for $d$ positive variables, involving $n$ generalized monomials with $n$ positive parameters. Existence and uniqueness of a solution for all…

Algebraic Geometry · Mathematics 2019-05-08 Stefan Müller , Josef Hofbauer , Georg Regensburger

The Galois ring $GR(p^r,m)$ of characteristic $p^r$ and cardinality $p^{rm}$, where $p$ is a prime and $r,m \ge 1$ are integers, is a Galois extension of the residue class ring $Z_{p^r}$ by a root $\omega$ of a monic basic irreducible…

Information Theory · Computer Science 2014-10-02 Virgilio Sison

The van der Waerden's Conjecture states that the set $\mathscr{P}_{n,N}^0(\mathbb{Q})$ of monic integer polynomials $f(X)$ of degree $n$, with height $\le N$ such that the Galois group $G_{K_f/\mathbb{Q}}$ of the splitting field…

Number Theory · Mathematics 2022-12-23 Ilaria Viglino

Let $K$ be a local field with finite residue field, we define a normal form for Eisenstein polynomials depending on the choice of a uniformizer $\pi_K$ and of residue representatives. The isomorphism classes of extensions generated by the…

Number Theory · Mathematics 2011-10-25 Maurizio Monge

We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…

Complex Variables · Mathematics 2023-02-14 Christopher J. Bishop , Kirill Lazebnik

Let $(R,\mm,K)$ be a regular local ring containing a field $k$ such that either char $k=0$ or char $k=p$ and tr-deg $K/\BF_p\geq 1$. Let $g_1,\ldots,g_t$ be regular parameters of $R$ which are linearly independent modulo $\mm^2$. Let…

Commutative Algebra · Mathematics 2014-08-13 M. K. Keshari , Swapnil A. Lokhande

We study parameterized linear differential equations with coefficients depending meromorphically upon the parameters. As a main result, analogously to the unparameterized density theorem of Ramis, we show that the parameterized monodromy,…

Classical Analysis and ODEs · Mathematics 2019-02-22 Thomas Dreyfus

Maps on a parameter space for expressing distribution functions are exactly derived from the Perron-Frobenius equations for a generalized Boole transform family. Here the generalized Boole transform family is a one-parameter family of maps…

Mathematical Physics · Physics 2018-04-18 Shin-itiro Goto , Ken Umeno

We disprove a strong form of the Regular Inverse Galois Problem: there exist finite groups $G$ which do not have a realization $F/\Qq(T)$ that induces all Galois extensions $L/\Qq(U)$ of group $G$ by specializing $T$ to $f(U) \in \Qq(U)$.…

Number Theory · Mathematics 2016-05-31 Pierre Dèbes

Via a generalization of the pseudospectral method for numerical solution of differential equations, a family of nonlinear algebraic identities satisfied by the zeros of a wide class of orthogonal polynomials is derived. The generalization…

Classical Analysis and ODEs · Mathematics 2018-06-19 Oksana Bihun , Clark Mourning

We review some basic facts on vector fields, in the complex-analytic setting, thus, obtaining a rationality result and an extension of the Birkhoff-Grothendieck theorem, as follows: (1) Let $Z$ be a compact complex manifold endowed with a…

Differential Geometry · Mathematics 2017-10-31 Radu Pantilie

In this paper we use the Galois module structure for the classical parameterizing spaces for elementary p-abelian extensions of a field K to give necessary and sufficient conditions for the solvability of any embedding problem which is an…

Number Theory · Mathematics 2014-03-28 Andrew Schultz

Assuming that the differential field $(K,\delta)$ is differentially large, in the sense of Le\'on S\'anchez and Tressl, and "bounded" as a field, we prove that for any linear differential algebraic group $G$ over $K$, the differential…

Logic · Mathematics 2020-09-15 Omar Leon Sanchez , Anand Pillay

Let $f(x,y)=0$ and $l(x,y)=0$ be respectively a singular and a regular analytic curve defined in the neighborhood of the origin of the complex plane. We study the family of analytic curves $f(x,y)-tl(x,y)^M=0$, where $t$ is a complex…

Algebraic Geometry · Mathematics 2012-08-07 Janusz Gwozdziewicz

We derive generalized generating functions for basic hypergeometric orthogonal polynomials by applying connection relations with one free parameter to them. In particular, we generalize generating functions for the Askey-Wilson, continuous…

Classical Analysis and ODEs · Mathematics 2018-06-01 Howard S. Cohl , Roberto S. Costas-Santos , Philbert R. Hwang , Tanay Wakhare

In this article we review known results on parameterized linear codes over graphs, introduced by Renter\'ia, Simis and Villarreal in 2011. Very little is known about their basic parameters and invariants. We review in detail the parameters…

Commutative Algebra · Mathematics 2021-12-15 Jorge Neves , Maria Vaz Pinto

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

Symbolic Computation · Computer Science 2020-05-06 Tao Zheng
‹ Prev 1 8 9 10 Next ›