Related papers: A New Upper Bound on Rubik's Cube Group
In this paper, we calculate the upper bound on quantum space complexity of the quantum algorithms proposed by Biasse and Song (SODA'16) for solving class group computation and the principal ideal problem using the reductions to $S$-unit…
Let C be an arbitrary simple-root cyclic code and let G be the subgroup of Aut(C) (the automorphism group of C) generated by the multiplier, the cyclic shift and the scalar multiplications. To the best of our knowledge, the subgroup G is…
The projective linear group \(\pgl(\comp,4)\) acts on cubic surfaces, considered as points of $\mathbb{P}_{\mathbb{C}}^{19}$. We compute the degree of the $15$-dimensional projective variety given by the Zariski closure of the orbit of a…
We present an improved algorithm for tabulating class groups of imaginary quadratic fields of bounded discriminant. Our method uses classical class number formulas involving theta-series to compute the group orders unconditionally for all…
It is well known that Rubik's cube has a set of group invariants. These values do not change if any layer was rotated, but they can change in case if some of the cubes were removed from the puzzle, mixed up and returned back. In this paper,…
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of…
We show upper bounds on the maximal dimension $d$ of Hilbert cubes $H=a_0+\{0,a_1\}+\cdots + \{0, a_d\}\subset S \cap [1, N]$ in several sets $S$ of arithmetic interest such as the squares, powerful numbers and pure powers.
{\it A unit cube in $k$-dimension (or a $k$-cube) is defined as the cartesian product $R_1 \times R_2 \times ... \times R_k$, where each $R_i$ is a closed interval on the real line of the form $[a_i, a_i+1]$. The {\it cubicity} of $G$,…
In this article, we obtain an upper bound for the number of integral solutions, of given height, of system of two quadratic forms in five variables. Our bound is an improvement over the bound given by Henryk Iwaniec and Ritabrata Munshi in…
We show there is an upper bound on the diameter of a closed, hyperbolic 3-manifold in terms of the length of any presentation of its fundamental group.
In this article we present the idea of clique ceiling numbers of the vertices of a given graph that has a universal vertex. We follow up with a polynomial-time algorithm to compute an upper bound for the clique number of such a graph using…
Using equivariant geometry, we find a universal formula that computes the number of times a general cubic surface arises in a family. As applications, we show that the PGL(4) orbit closure of a generic cubic surface has degree 96120, and…
The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…
Using Mazur's theorem on torsions of elliptic curves, an upper bound 24 for the order of the finite Galois group $\mathcal{H}$ associated with weighted walks in the quarter plane $\mathbb{Z}^2_+$ is obtained. The explicit criterion for…
The problem of finding the largest finite group with a certain class number (number of conjugacy classes), $k(G)$, has been investigated by a number of researchers since the early 1900's and has been solved by computer for $k(G) \leq 9$.…
In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The $k$-planar crossing number of a graph $cr_k(G)$ is the number of crossings required when every edge of $G$ must be drawn in…
An upper bound on the parameter that provides a generalized uncertainty principle (GUP) is obtained from the black hole shadow. With the aid of a recent constraint between regular black holes and the GUP parameter, it is indicated a…
New criteria are established for upper bounds on the number of limit cycles of periodic Abel differential equations having two periodic invariant curves, one of them bounded. The criteria are applied to obtain upper bounds of either zero or…
We improve the previuosly known bound for some vertex Folkman numbers.
We give upper bounds on the order of the automorphism group of a simple graph