中文
相关论文

相关论文: Enumeration of Linear Transformation Shift Registe…

200 篇论文

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…

数论 · 数学 2019-04-11 Gary McGuire , John Sheekey

In this paper we prove an identity in terms of generating functions which enables us to calculate the numbers of isomorphism classes of absolutely indecomposable semistable representations of quivers over finite fields.

表示论 · 数学 2021-10-27 Jiuzhao Hua

We present various identities in the form of convolutions involving Stirling numbers of both kinds, Lah numbers, and binomial coefficients. Certain convolution polynomials are discussed also. The proofs are based on several series…

组合数学 · 数学 2021-03-30 Khristo N. Boyadzhiev

We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then…

数论 · 数学 2017-10-20 Akihiro Munemasa , Hiroko Nakamura

In this paper, we present some necessary and sufficient conditions under which an irreducible polynomial is self-reciprocal (SR) or self-conjugate-reciprocal (SCR). By these characterizations, we obtain some enumeration formulas of SR and…

信息论 · 计算机科学 2020-01-15 Yansheng Wu , Qin Yue , Shuqin Fan

We study the addditon problem for strongly matricially free random variables which generalize free random variables. Using operators of Toeplitz type, we derive a linearization formula for the `matricial R-transform' related to the…

算子代数 · 数学 2015-03-17 Romuald Lenczewski

In this paper, the compositional inverses of a class of linearized permutation polynomials of the form $P(x)=x+x^2+\tr(\frac{x}{a})$ over the finite field $\mathbb{F}_{2^n}$ for an odd positive integer $n$ are explicitly determined.

组合数学 · 数学 2013-07-02 Baofeng Wu

We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…

动力系统 · 数学 2023-09-13 Robbert Fokkink , Dan Rust , Ville Salo

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

数论 · 数学 2009-07-16 L. Bary-Soroker

Let $\mathbb{F}_q[T]$ be the polynomial ring over a finite field $\mathbb{F}_q$. We study the endomorphism rings of Drinfeld $\mathbb{F}_q[T]$-modules of arbitrary rank over finite fields. We compare the endomorphism rings to their subrings…

数论 · 数学 2019-08-07 Sumita Garai , Mihran Papikian

We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…

代数几何 · 数学 2023-07-19 Andreas Gross , Trevor Gunn

We study tori which are cyclic covers of the standard torus, that is, the deck transformation group of the covering map is cyclic. These covering tori can be parametrized in a natural way and we show that being cyclic is equivalent to…

几何拓扑 · 数学 2016-04-28 Angel Pardo

We construct operators which factorize the transfer function associated with a non-self-adjoint 2x2 operator matrix whose diagonal entries can have overlapping spectra and whose off-diagonal entries are unbounded operators.

谱理论 · 数学 2007-05-23 V. Hardt , R. Mennicken , A. K. Motovilov

We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines.

逻辑 · 数学 2014-02-06 Merlin Carl

Five equivalence classes had been found for systems of two second-order ordinary differential equations, transformable to linear equations (linearizable systems) by a change of variables. An "optimal (or simplest) canonical form" of linear…

经典分析与常微分方程 · 数学 2011-04-19 Muhammad Safdar , Asghar Qadir , Sajid Ali

Rotation distance between rooted binary trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. We give an efficient,…

数据结构与算法 · 计算机科学 2018-03-19 Sean Cleary , Katherine St. John

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

组合数学 · 数学 2018-05-11 Erik Thörnblad , Jakob Zimmermann

The three dimensional Chern-Simons theory on $\rr^2_{\theta}\times \rr$ is studied. Considering the gauge transformations under the group elements which are going to one at infinity, we show that under arbitrary (finite) gauge…

高能物理 - 理论 · 物理学 2009-10-07 M. M. Sheikh-Jabbari

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

环与代数 · 数学 2017-03-22 Jason K. C. Polak

We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…

环与代数 · 数学 2023-08-01 Peter V. Danchev , Truong Huu Dung , Tran Nam Son