Nothing Special   »   [go: up one dir, main page]

Abért et al., 2005 - Google Patents

Dimension and randomness in groups acting on rooted trees

Abért et al., 2005

View PDF
Document ID
13773686389464765696
Author
Abért M
Virág B
Publication year
Publication venue
Journal of the American Mathematical Society

External Links

Snippet

We explore the structure of the $ p $-adic automorphism group $ Y $ of the infinite rooted regular tree. We determine the asymptotic order of a typical element, answering an old question of Turán. We initiate the study of a general dimension theory of groups acting on …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • G06F7/582—Pseudo-random number generators
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system

Similar Documents

Publication Publication Date Title
Abért et al. Dimension and randomness in groups acting on rooted trees
Ivanyos et al. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem
Korner et al. Zero-error information theory
Allender et al. On the complexity of numerical analysis
Lovász Random walks on graphs
Dvir et al. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Dick et al. Construction algorithms for polynomial lattice rules for multivariate integration
Cramer et al. Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time
Beame et al. Time–space tradeoffs for branching programs
Bringmann et al. Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
Frank Multidimensional constant-length substitution sequences
Banica Homogeneous quantum groups and their easiness level
Li Efficient approximate minimum entropy coupling of multiple probability distributions
Gentry et al. Obfuscation using tensor products
Håstad On the NP-hardness of Max-Not-2
Stockmeyer et al. Cosmological lower bound on the circuit complexity of a small problem in logic
Banica et al. Representations of quantum permutation algebras
O’Brien Algorithms for matrix groups
Gnedin et al. q-Exchangeability via quasi-invariance
Farsi et al. Purely Atomic Representations of Higher-Rank Graph C^* C∗-Algebras
Matus Divergence from factorizable distributions and matroid representations by partitions
Arvind et al. The complexity of black-box ring problems
Bernstein A random walk on the symmetric group generated by random involutions
Agrawal Rings and integer lattices in computer science
Ayyer et al. Random motion on finite rings, I: Commutative rings