𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Modulo-counting quantifiers over finite trees

✍ Scribed by Andreas Potthoff


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
976 KB
Volume
126
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Counting Representations of Quivers over
✍ Jiuzhao Hua πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 186 KB

dedicated to professor shaoxue liu on the occasion of his 70th birthday By counting the numbers of isomorphism classes of representations (indecomposable or absolutely indecomposable) of quivers over finite fields with fixed dimension vectors, we obtain a multi-variable formal identity. If the quive

Counting Points on Curves over Finite Fi
✍ Ming-Deh Huang; Doug Ierardi πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 602 KB

We consider the problem of counting the number of points on a plane curve, defined by a homogeneous polynomial F (x, y, z) ∈ Fq[x, y, z], which are rational over a ground field Fq. More precisely, we show that if we are given a projective plane curve C of degree n, and if C has only ordinary multipl

The Distribution of Reciprocal Pairs Mod
✍ Doug Hensley πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 665 KB

## Abstract Given a finite field __F__~__q__~ of order __q__, a fixed polynomial __g__ in –__F__~q~[__X__] of positive degree, and two elements __u__ and __v__ in the ring of polynomials in __R__ = __F__~__q__~ [__X__]/__gF__~__q__~[__X__], the question arises: How many pairs (a, 6) are there in __

Equivariant PoincarΓ© Polynomials and Cou
✍ M. Kisin; G.I. Lehrer πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 139 KB

Suppose a finite group acts as a group of automorphisms of a smooth complex algebraic variety which is defined over a number field. We show how, in certain circumstances, an equivariant comparison theorem in l-adic cohomology may be used to convert the computation of the graded character of the indu

Counting irreducible factors of polynomi
✍ Arnold Knopfmacher; John Knopfmacher πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 728 KB

Counting irreducible factors of polynomials over a finite field, Discrete Mathematics, 112 (1993) 103-l 18. Let F,[X] denote a polynomial ring in an indeterminate X over a finite field IF,. Exact formulae are derived for (i) the number of polynomials of degree n in F,[X] with a specified number of i