Related papers: The number of orientable small covers over cubes
We compute the time-dependent coverage in the random sequential adsorption of aligned d-dimensional cubes in $R^d$ using time-series expansions. The seventh-order series in 2, 3 and 4 dimensions is resummed in order to predict the coverage…
We compute the scaling dimensions of a family of fixed-charge operators at the infrared fixed point of the $O(N)$ model featuring cubic interactions in $d=6-\epsilon$ for arbitrary $N$ to leading and subleading order in the charge but to…
We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…
Started from our work "Fields on the Poincare Group and Quantum Description of Orientable Objects" (EPJC,2009), we consider here a classification of orientable relativistic quantum objects in 3+1 dimensions. In such a classification, one…
We consider the sets of dimensions for which there is an optimal sphere packing with special regularity properties (respectively, a lattice, or a periodic set with a given bound on the number of translations, or an arbitrary periodic set).…
We show that for certain class of oligomorphic groups there is a version of multiplication of double cosets in the Ismagilov--Olshanski sense. Categories of (reduced) double cosets are realized as certain categories of partial bijections.…
We classify compact complex surfaces which contain a Zariski open subset whose universal covering is the cylinder DxC.
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
An essential cover of the vertices of the $n$-cube $\{0,1\}^n$ by hyperplanes is a minimal covering where no hyperplane is redundant and every variable appears in the equation of at least one hyperplane. Linial and Radhakrishnan gave a…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
The paper continues the author's research in the problem of quantitative investigation of basic curvelinear quasiinvariants of quasiconformal curves. It concerns polygons with infinite number of vertices and provides various distortion…
This paper consists of two independent, but related parts. In the first part we show how to use symbolic computation to derive explicit expressions for the first few moments of the number of implicants that a random Boolean function has, or…
This article gives estimates on covering numbers and diameters of random proportional sections and projections of symmetric quasi-convex bodies in $\mathbb R$. These results were known for the convex case and played an essential role in…
This note shows that an interesting property arises when considering the relation between the hypersphere volumes at dimensions $n+1$ and $n$, if the hyperspheres circumscribe unitary hypercubes in $n+1$ and $n$ dimensions, respectively .…
We count the number of holomorphic orbi-spheres in the $\mathbb{Z}_2$-quotient of an elliptic curve. We first prove that there is an explicit correspondence between the holomorphic orbi-spheres and the sublattices of $\mathbb{Z} \oplus…
We define and prove characterizations of Hardy-Orlicz spaces of conformal densities.
The successful development and optimisation of optically-driven micromachines will be greatly enhanced by the ability to computationally model the optical forces and torques applied to such devices. In principle, this can be done by…
In $\mathbb{R}^n$, we establish an asymptotically sharp upper bound for the upper Minkowski dimension of $k$-porous sets having holes of certain size near every point in $k$ orthogonal directions at all small scales. This bound tends to…
We prove that at least $\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the…
The aim of this article is to obtain restrictions on complex orientations of dividing real J-curves of almost-complex manifolds. This problem comes from real algebraic geometry and the main result is a congruence generalising Arnol'd,…