Related papers: On mu-Symmetric Polynomials

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

For any fixed positive integer $n$, we study the root distribution of a sequence of polynomials $H_{m}(z)$ satisfying the rational generating function \[ \sum_{m=0}^{\infty}H_{m}(z)t^{m}=\frac{1}{1+B(z)t+A(z)t^{n}} \] where $A(z)$ and…

Isolating the real roots of univariate polynomials is a fundamental problem in symbolic computation and it is arguably one of the most important problems in computational mathematics. The problem has a long history decorated with numerous…

We consider the problem of learning a function respecting a symmetry from among a class of symmetries. We develop a unified framework that enables symmetry discovery across a broad range of subgroups including locally symmetric, dihedral…

In this paper we study dual bases functions in subspaces. These are bases which are dual to functionals on larger linear space. Our goal is construct and derive properties of certain bases obtained from the construction, with primary focus…

A skew polynomial ring $R=K[x;\sigma,\delta]$ is a ring of polynomials with non-commutative multiplication. This creates a difference between left and right divisibility, and thus a concept of left and right evaluations and roots. A…

We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…

In this paper, we study structure theorems of algebras of symmetric functions. Based on a certain relation on elementary symmetric polynomials generating such algebras, we consider perturbation in the algebras. In particular, we understand…

In 2023, Gullerud, Johnson, and Mbirika presented results on their study of certain tridiagonal real symmetric matrices. As part of their work, they studied the roots to nonhomogeneous equations related to characteristic polynomials of…

A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…

In this paper we explore a family of congruences over $\N^\ast$ from which one builds a sequence of symmetric matrices related to the Mertens function. From the results of numerical experiments, we formulate a conjecture about the growth of…

We provide an algorithm for the construction of orthonormal multivariate polynomials that are symmetric with respect to the interchange of any two coordinates on the unit hypercube and are constrained to the hyperplane where the sum of the…

Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…

We use the arithmetic of ideals in orders to parameterize the roots $\mu \pmod m$ of the polynomial congruence $F(\mu) \equiv 0 \pmod m$, $F(X) \in \mathbb{Z}[X]$ monic, irreducible and degree $d$. Our parameterization generalizes Gauss's…

This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…

We consider the Lommel functions $s_{\mu,\nu}(z)$ for different values of the parameters $(\mu,\nu)$. We show that if $(\mu,\nu)$ are half integers, then it is possible to describe these functions with an explicit combination of polynomials…

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…