English
Related papers

Related papers: The number of orientable small covers over cubes

200 papers

In this paper, we address a particular variation of the Tur\'an problem for the hypercube. Alon, Krech and Szab\'o (2007) asked "In an n-dimensional hypercube, Qn, and for l < d < n, what is the size of a smallest set, S, of Q_l's so that…

Combinatorics · Mathematics 2011-10-04 Brendon Stanton , Lale Özkahya

A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…

Combinatorics · Mathematics 2012-04-20 Olivier Bernardi , Guillaume Chapuy

The Rubik's Cube is the most popular puzzle in the world. Two of its studied aspects are God's Number, the minimum number of turns necessary to solve any state, and the first law of cubology, a solvability criterion. We modify previous…

Combinatorics · Mathematics 2021-12-17 Daniel Salkinder

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

Metric Geometry · Mathematics 2015-10-12 Márton Naszódi

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

Number Theory · Mathematics 2009-09-24 D. R. Heath-Brown , D. Testa

Since there is no hyperbolic Dehn filling theorem for higher dimensions, it is challenging to construct explicit hyperbolic manifolds of small volume in dimension at least four. Here, we build up closed hyperbolic 4-manifolds of volume…

Geometric Topology · Mathematics 2022-06-09 Jiming Ma , Fangting Zheng

We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r…

Metric Geometry · Mathematics 2008-03-03 Tom Kennedy

Hurwitz numbers enumerate ramified coverings of the Riemann sphere with fixed ramification data. Certain kinds of ramification data are of particular interest, such as double Hurwitz numbers, which count covers with fixed arbitrary…

Combinatorics · Mathematics 2018-10-09 Marvin Anas Hahn

For a set $S$ of $n$ disjoint line segments in $\mathbb{R}^{2}$, the visibility counting problem is to preprocess $S$ such that the number of visible segments in $S$ from any query point $p$ can be computed quickly. There have been…

Computational Geometry · Computer Science 2021-03-16 Sharareh Alipour

The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…

Group Theory · Mathematics 2007-05-23 Yi Ming Zou

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

Logic in Computer Science · Computer Science 2017-04-11 Arno Pauly

We examine what integers are representable as sums of three cubes. We also provide formulas for the number of representations of $x^3+y^3+z^3=n$ under the condition $x+y+z=t$. Also we show how the problem of three cubes is related to…

General Mathematics · Mathematics 2020-09-28 Nikos Bagis

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

Combinatorics · Mathematics 2025-10-06 Paata Ivanisvili , Ohad Klein , Roman Vershynin

We investigate orthogonal representations of compact Lie groups from the point of view of their quotient spaces, considered as metric spaces. We study metric spaces which are simultaneously quotients of different representations and…

Differential Geometry · Mathematics 2013-01-14 Claudio Gorodski , Alexander Lytchak

"Most" hypersurfaces in projective space are irreducible, and rather precise estimates are known for the probability that a random hypersurface over a finite field is reducible. This paper considers the parametrization of space curves by…

Number Theory · Mathematics 2013-07-08 Eda Cesaratto , Joachim von zur Gathen , Guillermo Matera

Working in doubling metric spaces, we examine the connections between different dimensions, Whitney covers, and geometrical properties of tubular neighborhoods. In the Euclidean space, we relate these concepts to the behavior of the surface…

Metric Geometry · Mathematics 2017-02-03 Antti Käenmäki , Juha Lehrbäck , Matti Vuorinen

Cubical rectangles are being defined and explored here over the $n-$dimensional geometric cube $Q_n.$ They form a new class of geometric objects that includes all the edges and all the squares of the $n-$cube. We enumerate and characterize…

Combinatorics · Mathematics 2023-06-12 M. Reza Emamy-K

In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon,…

Combinatorics · Mathematics 2008-04-17 Valery A. Liskovets

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke