Related papers: Modular local polynomials

We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

In this paper local polynomials on Abelian groups are characterized by a "local" Fr\'echet-type functional equation. We apply our result to generalize Montel's Theorem and to obtain Montel-type theorems on commutative groups.

For a polynomial $u=u(x)$ in $\mathbb{Z}[x]$ and $r\in\mathbb{Z}$, we consider the orbit of $u$ at $r$ denoted and defined by $\mathcal{O}_u(r):=\{u(r),u(u(r)),\ldots\}$. We ask two questions here: (i) what are the polynomials $u$ for which…

We investigate different approaches to transform a given binomial into a monomial via blowing up appropriate centers. In particular, we develop explicit implementations in {\sc Singular}, which allow to make a comparison on the basis of…

We use maximal periodic flats to show that on a finite volume irreducible locally symmetric manifold of dimension $\geq 3$, no metric $g$ has more symmetry than the locally symmetric metric. We also show that if $g$ is a finite volume…

We study D-modules and related invariants on the space of 2 x 2 x n hypermatrices for n >= 3, which has finitely many orbits under the action of G = GL_2 x GL_2 x GL_n. We describe the category of coherent G-equivariant D-modules as the…

We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…

We study the multifractal analysis of self-similar measures arising from random homogeneous iterated function systems. Under the assumption of the uniform strong separation condition, we see that this analysis parallels that of the…

In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets in Kelly's example have bounded Boolean dimension and bounded local dimension, leading naturally to the questions as to whether either…

We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…

We introduce a notion of embedding codimension of an arbitrary local ring, establish some general properties, and study in detail the case of arc spaces of schemes of finite type over a field. Viewing the embedding codimension as a measure…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

This paper investigates the bias and the weak Bahadur representation of a local polynomial estimator of the conditional quantile function and its derivatives. The bias and Bahadur remainder term are studied uniformly with respect to the…

We define zonal polynomials of quaternion matrix argument and deduce some important formulae of zonal polynomials and hypergeometric functions of quaternion matrix argument. As an application, we give the distributions of the largest and…

In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…

In this paper two identities involving a function defined by the complete elliptic integrals of the first and second kinds are proved. Some functional inequalities and elementary estimates for this function are also derived from the…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

In this paper we describe the well studied process of renormalization of quadratic polynomials from the point of view of their natural extensions. In particular, we describe the topology of the inverse limit of infinitely renormalizable…

Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric…