Related papers: Quadratic Probabilistic Algorithms for Normal Base…
For a number field K with absolute Galois group G_K, we consider the action of G_K on the infinite tree of preimages of a point in K under a degree-two rational function phi, with particular attention to the case when phi commutes with a…
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator…
Let $K$ be a field, and let $f\in K(z)$ be rational function. The preimages of a point $x_0\in P^1(K)$ under iterates of $f$ have a natural tree structure. As a result, the Galois group of the resulting field extension of $K$ naturally…
We introduce quantized bipartite walks, compute their spectra, generalize the algorithms of Grover \cite{g} and Ambainis \cite{amb03} and interpret them as quantum walks with memory. We compare the performance of walk based classical and…
The Weibull distribution can be obtained using a power transformation from the standard exponential distribution. In this article, we will consider a symmetrized power transformation of a random variable with the standard normal…
Let k_0 be a field of characteristic 0, k its algebraic closure, G a connected reductive group defined over k. Let H\subset G be a spherical subgroup. We assume that k_0 is a large field, for example, k_0 is either the field R of real…
The G-Wishart distribution is an essential component for the Bayesian analysis of Gaussian graphical models as the conjugate prior for the precision matrix. Evaluating the marginal likelihood of such models usually requires computing…
Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function…
Let $L/K$ be a finite Galois extension of fields with group $\Gamma$. Associated to each Hopf-Galois structure on $L/K$ is a group $G$ of the same order as the Galois group $\Gamma$. The type of the Hopf-Galois structure is by definition…
Using the standard finite element method (FEM) to solve general partial differential equations, the round-off error is found to be proportional to $N^{\beta_{\rm R}}$, with $N$ the number of degrees of freedom (DoFs) and $\beta_{\rm R}$ a…
Let $K$ be a subgroup of a finite group $G$, and suppose that $G=KN_G(P)$ for every Sylow subgroup $P$ of $K$. Then the subgroup $K$ is normal in $G$.
Barrucand and Cohn's theory of principal factorizations in pure cubic fields \(\mathbb{Q}(\sqrt[3]{D})\) and their Galois closures \(\mathbb{Q}(\zeta_3,\sqrt[3]{D})\) with \(3\) types is generalized to pure quintic fields…
Let $K$ be a number field with ring of integers $\mathcal{O}_K$ and $G$ a finite group of odd order. If $K_h$ is a weakly ramified $G$-Galois $K$-algebra, then its square root $A_h$ of the inverse different is a locally free…
In this paper we give a conjecture for the average number of unramified $G$-extensions of a quadratic field for any finite group $G$. The Cohen-Lenstra heuristics are the specialization of our conjecture to the case that $G$ is abelian of…
Let $ G $ be a connected reductive algebraic group over $ \C $. We denote by $ K = (G^{\theta})_{0} $ the identity component of the fixed points of an involutive automorphism $ \theta $ of $ G $. The pair $ (G, K) $ is called a symmetric…
It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to the oracle function, the states corresponding to…
We mainly study exceptional configuration for coined quantum walk search. For searching on a two-dimensional grid by AKR algorithm, we find some new classes of exceptional configurations that cannot be found by the AKR algorithm effectively…
To begin, we find certain formulas $Q(k,\alpha)= G_1^k(\alpha) G_2^k(\alpha)$, for $k = -1, 0, 1,...,9$. These yield that part of the total separability probability, $P(k,\alpha)$, for generalized (real, complex, quaternionic,\ldots)…
We introduce the notion of the \textit{principal element} of a Frobenius Lie algebra $\f$. The principal element corresponds to a choice of $F\in \f^*$ such that $F[-,-]$ non-degenerate. In many natural instances, the principal element is…
Let $K$ be an algebraic number field with ring of integers $\Cal{O}_{K}$, $p>2$ be a rational prime and $G$ be the cyclic group of order $p $. Let $\Lambda$ denote the order $\Cal{O}_{K}[G].$ Let $Cl(\Lambda)$ denote the locally free class…