Related papers: A New Upper Bound on Rubik's Cube Group

Let $G$ be a semisimple linear algebraic group over a field $k$ and let $G^+(k)$ be the subgroup generated by the subgroups $R_u(Q)(k)$, where $Q$ ranges over all the minimal $k$-parabolic subgroups $Q$ of $G$. We prove that if $G^+(k)$ is…

We give uniform upper bounds for the number of rational points of height at most $B$ on non-singular complete intersections of two quadrics in $\mathbb{P}^3$ defined over $\mathbb{Q}$. To do this, we combine determinant methods with descent…

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

The b-chromatic number $b(G)$ of a graph $G$ is the maximum $k$ for which $G$ has a proper vertex coloring using $k$ colors such that each color class contains at least one vertex adjacent to a vertex of every other color class. In this…

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

Let $K$ be a multiquadratic extension of $\mathbb{Q}$ and let $\text{Cl}^{+}(K)$ be its narrow class group. Recently, the authors \cite{KP} gave a bound for $|\text{Cl}^{+}(K)[2]|$ only in terms of the degree of $K$ and the number of…

Let $G$ be a connected graph. The \emph{rainbow connection number $rc(G)$} of a graph $G$ was recently introduced by Chartrand et al. Li et al. proved that for every bridgeless graph $G$ with diameter 2, $rc(G)\leq 5$. They gave examples…

In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.

We generalize the Rubik's cube, together with its group of configurations, to any abstract regular polytope. After discussing general aspects, we study the Rubik's simplex of arbitrary dimension and provide a complete description of the…

The strong symmetric genus of a finite group is the minimum genus of a compact Riemann surface on which the group acts as a group of automorphisms preserving orientation. A characterization of the infinite number of groups with strong…

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight <=k in…

In 1999 Brady constructed the first example of a non-hyperbolic finitely presented subgroup of a hyperbolic group by fibring a non-positively curved cube complex over the circle. We show that his example has Dehn function bounded above by…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

We improve known upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and non-periodic settings. Some of our bounds are sharp up to logarithmic factors.

A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

We establish new upper bounds for the height of the S-integral points of an elliptic curve. This bound is explicitly given in terms of the set S of places of the number field K involved, but also in terms of the degree of K, as well as the…

The $n$-th Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by binary strings with no two consecutive ones. We determine $\pi(\Gamma_n) = 2^n$ for $n \le 6$, so the pebbling number of $\Gamma_n$ equals that of the…

An axis-parallel b-dimensional box is a Cartesian product $R_1 \times R_2 \times ... \times R_b$ where each $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i,b_i]$ on the real line. The boxicity of any graph $G$, box(G)…

In this article we give an upper bound for the number of cusps on a cuspidal curve on a Hirzebruch surface. We adapt the results that have been found for a similar question asked for cuspidal curves on the projective plane, and restate the…