中文
相关论文

相关论文: A Swan-like note for a family of binary pentanomia…

200 篇论文

A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…

混沌动力学 · 物理学 2007-05-23 Ricardo Lopez-Ruiz

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

交换代数 · 数学 2022-05-11 Nicholas Phat Nguyen

We give a new formula for the values of an irreducible character of the symmetric group S_n indexed by a partition of rectangular shape. Some observations and a conjecture are given concerning a generalization to arbitrary shapes.

组合数学 · 数学 2007-05-23 Richard P. Stanley

We consider the irreducibility of Generalised Laguerre Polynomials for negative integral values given by $L_n^{(-1-n-s)}(x)=\displaystyle\sum_{j=0}^{n}\binom{n-j+s}{n-j}\frac{x^j}{j!}.$ For different values of $s,$ this family gives…

数论 · 数学 2022-03-02 Saranya G Nair , Tarlok Nath Shorey

Given a field $K$ and $n > 1$, we say that a polynomial $f \in K[x]$ has newly reducible $n$th iterate over $K$ if $f^{n-1}$ is irreducible over $K$, but $f^n$ is not (here $f^i$ denotes the $i$th iterate of $f$). We pose the problem of…

数论 · 数学 2021-11-24 Peter Illig , Rafe Jones , Eli Orvis , Yukihiko Segawa , Nick Spinale

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

偏微分方程分析 · 数学 2010-10-18 Ekaterina Shemyakova

In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…

表示论 · 数学 2017-06-08 Erik Koelink , Maarten van Pruijssen , Pablo Román

We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible…

分布式、并行与集群计算 · 计算机科学 2025-10-20 Anton Leykin , Jan Verschelde

We study a sequence of polynomials orthogonal with respect to a one parameter family of weights $$ w(x):=w(x,t)=\rex^{-t/x}\:x^{\al}(1-x)^{\bt},\quad t\geq 0, $$ defined for $x\in[0,1].$ If $t=0,$ this reduces to a shifted Jacobi weight.…

经典分析与常微分方程 · 数学 2010-08-03 Yang Chen , Dan Dai

I discuss a variety of results involving s(n), the number of representations of n as a sum of three squares. One of my objectives is to reveal numerous interesting connections between the properties of this function and certain modular…

数论 · 数学 2012-07-05 Alexander Berkovich

We prove that, unless $\mathrm{P}=\mathrm{NP}$, no polynomial algorithm can approximate the minimum length of \sws for a given \san within a constant factor.

形式语言与自动机理论 · 计算机科学 2015-05-14 M. V. Berlinkov

In this paper, by analyzing the quadratic factors of an $11$-th degree polynomial over the finite field $\ftwon$, a conjecture on permutation trinomials over $\ftwon[x]$ proposed very recently by Deng and Zheng is settled, where $n=2m$ and…

信息论 · 计算机科学 2018-09-11 Nian Li , Qiaoyu Hu

In this article, families of non-linear subdivision schemes are presented that are based on univariate polynomials up to degree three. Theses families of schemes are constructed by using dynamic iterative re-weighed least squares method.…

数值分析 · 数学 2019-05-14 Ghulam Mustafa , Rabia Hameed

Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…

数论 · 数学 2024-05-08 Lior Bary-Soroker , Daniele Garzoni , Vlad Matei

In this paper we consider the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ with coprime integers $a\neq u>0$. We prove irreducibility over $\mathbb{Z}$ by excluding all degree-8 splittings. First, any putative $4{+}4$ factorization is…

综合数学 · 数学 2025-10-14 Valery Asiryan

A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…

数学软件 · 计算机科学 2018-06-19 Jan Verschelde

For n=1,2,3,... let N_n(q) denote the number of monic irreducible polynomials over the finite field F_q. We mainly show that the sequence N_n(q)^{1/n} (n>e^{3+7/(q-1)^2}) is strictly increasing and the sequence…

数论 · 数学 2012-10-16 Zhi-Wei Sun

In this paper, we derive explicit formulas for computing the roots of $ax^{2}+bx+c=0$ with $a$ being not invertible in split quaternion algebra. We also imitate the approach developed by Opfer, Janovska and Falcao etc. to verify our results…

代数几何 · 数学 2024-03-29 Wensheng Cao

The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic…

信息论 · 计算机科学 2017-09-15 Minjia Shi , Zhongyi Zhang , Patrick Sole

Given an integer $n\geq 1$ and an irreducible character $\chi_{\lambda}$ of $S_{n}$ for some partition $\lambda$ of $n$, the immanant $\mathrm{imm}_{\lambda}:\mathbb{C}^{n\times n}\to\mathbb{C}$ maps matrices $A\in\mathbb{C}^{n\times n}$ to…

计算复杂性 · 计算机科学 2021-02-09 Radu Curticapean