Related papers: A new upper bound for mutually touching infinite c…

Band structure for a crystal generally consists of connected components in energy-momentum space, known as band complexes. Here, we explore a fundamental aspect regarding the maximal number of bands that can be accommodated in a single band…

A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs of beads of different colors. We give a counterexample for…

We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…

We consider the critical points (equilibria) of a planar potential generated by $n$ Newtonian point masses augmented with a quadratic term (such as arises from a centrifugal effect). Particular cases of this problem have been considered…

In 1975 Pippenger and Golumbic proved that any graph on $n$ vertices admits at most $2e(n/k)^k$ induced $k$-cycles. This bound is larger by a multiplicative factor of $2e$ than the simple lower bound obtained by a blow-up construction.…

We show that the maximum number of pairwise intersecting positive homothets of a $d$-dimensional centrally symmetric convex body, none of which contains the center of another in its interior, is at most $3^{d+1}$. Also, we improve upper…

The present paper is devoted to the study of the maximum number of limit cycles bifurcated from the periodic orbits of the quadratic isochronous center $\dot{x}=-y+\frac{16}{3}x^{2}-\frac{4}{3}y^{2},\dot{y}=x+\frac{8}{3}xy$ by the averaging…

We consider problems concerning the largest degrees of irreducible characters of symmetric groups, and the multiplicities of character degrees of symmetric groups. Using evidence from computer experiments, we posit several new conjectures…

The so-called {\it kissing number} for hyperbolic surfaces is the maximum number of homotopically distinct systoles a surface of given genus $g$ can have. These numbers, first studied (and named) by Schmutz Schaller by analogy with lattice…

We obtain a new lower bound on the radius of the largest ball of separable unnormalized states around the identity matrix for a 3-qubit system. This also enables us to improve the corresponding lower bounds for multi-qubit systems. These…

It is shown that there exist infinitely many triangular numbers (congruent to 3 mod 12) which cannot be the distance between two perfect numbers.

Given an elliptic surface $\mathcal{E}\to\mathcal{C}$ over a field $k$ of characteristic zero equipped with zero section $O$ and another section $P$ of infinite order, we give a simple and explicit upper bound on the number of points where…

We generalize the lemmas of Thomas Kretschmer to arbitrary number fields, and apply them with a 2-descent argument to obtain bounds for families of elliptic curves over certain imaginary quadratic number fields with class number 1. One such…

Edoukou, Ling and Xing in 2010, conjectured that in \mathbb{P}^n(\mathbb{F}_{q^2}), n \geq 3, the maximum number of common points of a non-degenerate Hermitian variety \mathcal{U}_n and a hypersurface of degree d is achieved only when the…

For a non-degenerate irreducible curve $C$ of degree $d$ in $\mathbb{P}^3$ over $\mathbb{F}_q$, we prove that the number $N_q(C)$ of $\mathbb{F}_q$-rational points of $C$ satisfies the inequality $N_q(C) \leq (d-2)q+1$. Our result improves…

Let $T(\Z_m \times \Z_n)$ denote the maximal number of points that can be placed on an $m \times n$ discrete torus with "no three in a line," meaning no three in a coset of a cyclic subgroup of $\Z_m \times \Z_n$. By proving upper bounds…

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…

In this paper1 , we use the coding developed by R. Bowen and C. Series to compute the number of self-intersections of a closed geodesic on a pair of pants. We give lower and upper bounds on the number of self-intersections of a closed…

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…