Related papers: Cannonball Polygons with Multiplicities

In this work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…

The present article includes the enumeration of $n$-polygons with a certain symmetry property: For an even number $n$ of vertices, we count the $n$-polygons with $\frac{n}{2}$ symmetry axes. In addition, if $n$ is a power of 2, we show the…

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

A classical result of Honsberger states that the number of incongruent triangles with integer sides and perimeter $n$ is the nearest integer to $\frac{n^2}{48}$ ($n$ even) or $\frac{(n+3)^2}{48}$ ($n$ odd). We solve the analogous problem…

The most general large ${\cal N}=4$ superconformal ${\cal W}_{\infty}$ algebra, containing in addition to the superconformal algebra one supermultiplet for each integer spin, is analysed in detail. It is found that the ${\cal W}_{\infty}$…

In this article we study the number of different cuboids $\mathcal{O}(N)$ that can be built with an arbitrary number $N$ of equal cubes. This problem is equivalent to find the number of different cuboids of volume $N$ with integer length…

We consider a generalization of the quaternion ring $\Big(\frac{a,b}{R}\Big)$ over a commutative unital ring $R$ that includes the case when $a$ and $b$ are not units of $R$. In this paper, we focus on the case $R=\mathbb{Z}/n\mathbb{Z}$…

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

We explain why numbers occurring in the classification of polygon spaces coincide with numbers of self-dual equivalence classes of threshold functions, or of regular Boolean functions, or of decisive weighted majority games.

We ask whether the only multiplicities in the spectrum of the clamped round plate are trivial, i.e., whether all existing multiplicities are due to the isometries of the sphere, or, equivalently, whether any eigenfunction is separated. We…

Let $P_8(x)=3x^2-2x$. For positive integers $a_1,a_2,\dots,a_k$, a polynomial of the form $a_1P_8(x_1)+a_2P_8(x_2)+\cdots+a_kP_8(x_k)$ is called an octagonal form. For a positive integer $n$, an octagonal form is called tight $\mathcal…

We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.

We show that the lattice Hadwiger number of superballs is exponential in the dimension. The same is true for some more general convex bodies.

Motivated by a question of W. Kuperberg, we study the 18-dimensional manifold of configurations of 6 non-intersecting infinite cylinders of radius $r,$ all touching the unit ball in $\mathbb{R}^{3}.$ We find a configuration with \[…

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

Part I: The two-dimensional Pascal Triangle will be generalized into a three-dimensional Pascal Pyramid and four-, five- or whatsoever-dimensional hyper-pyramids. Part II: The Bilateral Binomial Theorem will be generalised into a Bilateral…

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

We apply the pigeonhole principle to show that there must exist Boolean functions on 7 inputs with a multiplicative complexity of at least 7, i.e., that cannot be computed with only 6 multiplications in the Galois field with two elements.

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…