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

We analyze further the IR singularities that appear in noncommutative field theories on R^d. We argue that all IR singularities in nonplanar one loop diagrams may be interpreted as arising from the tree level exchanges of new light degrees…

In this paper, we compute the number of distinct centralizers of some classes of finite rings. We then characterize all finite rings with $n$ distinct centralizers for any positive integer $n \leq 5$. Further we give some connections…

In this paper, we investigate permutation polynomials over the finite field $\mathbb F_{q^n}$ with $q=2^m$, focusing on those in the form $\mathrm{Tr}(Ax^{q+1})+L(x)$, where $A\in\mathbb F_{q^n}^*$ and $L$ is a $2$-linear polynomial over…

In this paper we examine the sorting operator $T(LnR)=T(R)T(L)n$. Applying this operator to a permutation is equivalent to passing the permutation reversed through a stack. We prove theorems that characterise $t$-revstack sortability in…

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

We consider the problem of defining and computing real analogs of polynomial Hurwitz numbers, in other words, the problem of counting properly normalized real polynomials with fixed ramification profiles over real branch points. We show…

An equivariant linear system on a toric variety is a linear system invariant under the torus action. We study the number of irreducible components of the complete intersection of general divisors from a fixed collection of equivariant…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Linear Feedback Shift Registers (LFRS) are tools commonly used in cryptography in many different context, for example as pseudo-random numbers generators. In this paper we characterize LFRS with certain symmetry properties. Related to this…

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

A Leonard pair is a pair of diagonalizable linear transformations of a finite-dimensional vector space, each of which acts in an irreducible tridiagonal fashion on an eigenbasis for the other one. In the present paper we give an elementary…

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…

We give in this paper a survey of results obtained in our earlier papers, and state explicitly some problems of further research, for example: are the analytic ranks bounded, or not? Twists of Carlitz modules are parametrized by polynomials…

In this paper, with the help of trinomial coefficients we study some arithmetic properties of certain determiants involving reciprocals of binary quadratic forms over finite fields.

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

We study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing…

We investigate the Bieri--Neumann--Strebel--Renz (BNSR) invariants of irreducible uniform lattices. In the case of a direct product of a tree and a Euclidean space we show that vanishing of the BNSR invariants for all finite-index subgroups…

Analytical tools to $K$-theory; namely, self-stabilization of rapidly decreasing matrices, linearization of cyclic loops, and the contractibility of the pointed stable Toeplitz algebra are discussed in terms of concrete formulas. Adaptation…

We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…

The construction of shortest feedback shift registers for a finite sequence S_1,...,S_N is considered over the finite ring Z_{p^r}. A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for…