PERMUTATION STRINGS Jeffrey A. Barnett1 Problem: What is the length of the shortest string on an alphabet of n symbols that contains all n! permutations of the alphabet as (contiguous)

Source URL: www.notatt.com

A Permutation-Based Kernel Conditional Independence Test: Supplementary Materials A PROOFS

Source URL: krikamol.org

Exploiting Probabilistic Independence for Permutations Jonathan Huang, Carlos Guestrin Stanford University Pittsburgh, Pennsylvania 15213

Source URL: select.cs.cmu.edu

• Mathematical analysis
• Mathematics
• Algebra
• Fourier analysis
• Mathematical physics
• Joseph Fourier
• Integral transforms
• Unitary operators
• Fourier transform
• Convolution
• Permutation group
• Permutation

(Prefix) Reversal Distance for (Signed) Strings with Few Blocks or Small AlphabetsI Laurent Bulteaua,1 , Guillaume Fertinb,2 , Christian Komusiewiczc,2,3 a Laboratoire d’Informatique Gaspard Monge, CNRS UMR 8049, Univ

Source URL: users.minet.uni-jena.de

• Formal languages
• Computability theory
• Theory of computation
• Character encoding
• String
• Computable function
• Permutation
• Pattern language

More on Shabal’s permutation Jean-Philippe Aumasson1 , Atefeh Mashatan2 , and Willi Meier1

Source URL: 131002.net

Ecient Probabilistic Inference with Partial Ranking Queries Jonathan Huang Ashish Kapoor Carlos Guestrin

Source URL: select.cs.cmu.edu

• Mathematical analysis
• Exponential family
• Exponentials
• Permutation
• Measure theory

MOSER’S FIX-IT ALGORITHM 81 and π(2) = j. We claim that |S12 | ≤ |Sij | for all i 6= j. Indeed, suppose first that i, j > 2. For each good π ∈ S12 define a permutation π ∗ as follows. Suppose

Source URL: cs.nyu.edu

ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

Source URL: www.math.lsa.umich.edu

• Mathematics
• Permutations
• Linear algebra
• Matrix theory
• Algebra
• Permanent
• Computing the permanent
• Permutation
• Hamiltonian path
• Tournament

Advances in Applied Mathematics 24, 284–doi:aama, available online at http://www.idealibrary.com on The Excedance Set of a Permutation Richard Ehrenborg School of Mathematics, Institute for

Source URL: www.math.kth.se

Finite Fourier Series and Ovals in PG(2, 2h) J. Chris Fisher Department of Mathematics University of Regina Regina, Canada S4S 0A2

Source URL: www.ntu.edu.sg

• Mathematics
• Mathematical analysis
• Incidence geometry
• Oval
• Projective geometry
• Permutation polynomial
• Operator theory
• Heat equation
• FeynmanKac formula