منابع مشابه
Hilbert Functions of Finite Group Orbits: Abelian and Metacyclic Groups
This thesis is concerned with Hilbert functions of ideals of finite group orbits, focusing in particular on abelian and metacyclic groups. Conjecture 16 in Section 4 characterizes the Hilbert functions that arise from two-dimensional representations of certain abelian groups, and a proof of the necessity of its conditions is provided. In Section 6, Proposition 18 gives a bound for the Hilbert f...
متن کاملWall rational functions and Khrushchev’s formula for orthogonal rational functions
We prove that the Nevalinna-Pick algorithm provides different homeomorphisms between certain topological spaces of measures, analytic functions and sequences of complex numbers. This algorithm also yields a continued fraction expansion of every Schur function, whose approximants are identified. The approximants are quotients of rational functions which can be understood as the rational analogs ...
متن کاملThe Art of Iterating Rational Functions over Finite Fields
The field of complex dynamical systems generated by iteration of polynomials and rational functions is a classical area of mathematics with a rich history and a wide variety of results. Recently, there has been substantial interest in arithmetical dynamical systems (ADS), meaning the iteration of rational functions over fields of number-theoretic interest. Although isolated results regarding AD...
متن کاملRATIONAL CHARACTER TABLE OF SOME FINITE GROUPS
The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational charact...
متن کاملPeriods of Iterated Rational Functions over a Finite Field
If f is a polynomial of degree d in Fq[x], let ck(f) be the number of cycles of length k in the directed graph on Fq with edges {(v, f(v))}v∈Fq . For random polynomials, the numbers ck, 1 ≤ k ≤ b, have asymptotic behavior resembling that for the cycle lengths of random functions f : [q] → [q]. However random polynomials differ from random functions in important ways. For example, given the set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 2007
ISSN: 0019-3577
DOI: 10.1016/s0019-3577(07)80017-6