Related papers: Cross-sections of multibrot sets

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…

We provide a complete classification, in the language of weak-combinatorics, of minimal plus-one generated line arrangements in the complex projective plane with double and triple intersection points.

This paper deals with the Orchard crossing number of some families of graphs which are based on cycles. These include disjoint cycles, cycles which share a vertex and cycles which share an edge. Specifically, we focus on the prism and…

In this note we present some algebraic examples of multicomplexes whose differentials differ from those in the spectral sequences associated to the multicomplexes. The motivation for constructing examples showing the algebraic distinction…

The spectrum of tight binding electrons on a square lattice with half a magnetic flux quantum per unit cell exhibits two Dirac points at the band center. We show that, in the presence of an additional uniaxial staggered potential, this pair…

Using $e^+e^-$ collision data collected with the BESIII detector operating at the Beijing Electron Positron Collider, the cross section of $e^+e^-\to \pi^+\pi^- h_c$ is measured at 59 points with center-of-mass energy $\sqrt{s}$ ranging…

We study Hausdorff limits of the external rays of a given periodic angle along a convergent sequence of polynomials of degree $d \geq 2$ with connected Julia sets.

Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

In this paper, we study the embedding of a complete balanced $d$-partite $d$-uniform hypergraph with all its $nd$ vertices represented as points in general position in $\mathbb{R}^d$ and each hyperedge drawn as a convex hull of $d$…

Let p be a puncture of a punctured sphere, and let Q be the set of all other punctures. We prove that the maximal cardinality of a set of arcs pairwise intersecting at most once, which start at p and end in Q, is |X|(|X| + 1). We deduce…

We prove a common generalization of two results, one on rainbow fractional matchings and one on rainbow sets in the intersection of two matroids: Given $d = r \lceil k \rceil - r + 1$ functions of size (=sum of values) $k$ that are all…

Multifragment emission following Xe+Au collisions at 30, 40, 50 and 60 AMeV has been studied with multidetector systems covering nearly 4-pi in solid angle. The correlations of both the intermediate mass fragment and light charged particle…

Let $X$ be a finite collection of sets. We count the number of ways a disjoint union of $n-1$ subsets in $X$ is a set in $X$, and estimate this number from above by $|X|^{c(n)}$ where $$ c(n)=\left(1-\frac{(n-1)\ln (n-1)}{n\ln n}…

We study the spectrum of the join of several circulant matrices. We apply our results to compute explicitly the spectrum of certain graphs obtained by joining several circulant graphs.

We establish the upper bound in the multiplicity conjecture of Herzog, Huneke and Srinivasan for the codimension three almost complete intersections. We also give some partial results in the case where I is the aci linked to a complete…

We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can…

The class of intersection bigraphs of unit intervals of the real line whose ends may be open or closed is called a class of mixed unit interval bigraphs. This class of bigraphs is a strict superclass of the class of unit interval bigraphs.…

We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…

The notion of cross intersecting set pair system of size $m$, $\Big(\{A_i\}_{i=1}^m, \{B_i\}_{i=1}^m\Big)$ with $A_i\cap B_i=\emptyset$ and $A_i\cap B_j\ne\emptyset$, was introduced by Bollob\'as and it became an important tool of extremal…