相关论文: Cross-sections of multibrot sets

Intersection of a random fractal or self-affine set with a linear manifold or another fractal set is studied, assuming that one of the sets is in a translational motion with respect to the other. It is shown that the mass of such an…

Deep X-ray data from CHANDRA and XMM-Newton, and GMRT radio data are presented for ZwCl 2341.1+0000, an extremely unusual and complex merging cluster of galaxies at the intersection of optical filaments. We propose that energetics of…

A family of subsets of $\{1,\ldots,n\}$ is called {\it intersecting} if any two of its sets intersect. A classical result in extremal combinatorics due to Erd\H{o}s, Ko, and Rado determines the maximum size of an intersecting family of…

We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We derive a lower bound…

The exposition has been significantly altered, hopefully improved.

High energy hadronic total cross-section data are found to agree with the predictions of a QCD-string picture.

We describe each multiple curve on the orientable surface of genus-$g$ with $n$ punctures and one boundary component by using this multiple curve's geometric intersection number with the embedded curves in this surface.

We observe that numerous symplectic resolutions can be expressed as intersections of twisted cotangent bundles. Additionally, their dual symplectic resolutions can be derived from intersections of dual twisted cotangent bundles. We…

In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…

Let $V$ be a left $R$-module where $R$ is a (not necessarily commutative) ring with unit. The intersection graph $\cG(V)$ of proper $R$-submodules of $V$ is an undirected graph without loops and multiple edges defined as follows: the vertex…

Given a bounded $C^1$ domain $\Omega\subset\R^n$ and a nonempty subset $E$ of its boundary (set of tomography), we consider broken rays which start and end at points of $E$. We ask: If the integrals of a function over all such broken rays…

In this paper, we characterise ovoidal cones by their intersection numbers. We first show that a set of points of $\mathrm{PG}(4,q)$ which intersects planes in $1$, $q+1$ or $2q+1$ points is either an ovoidal cone or a parabolic quadric,…

We determine (multi)graded Betti numbers of path ideals of lines and star graphs.

In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…

We give a classification of generic bifurcations of intersections of wavefronts generated by different points of a hypersurface with or without boundaries.

We investigate type I multiple orthogonal polynomials on $r$ intervals which have a common point at the origin and endpoints at the $r$ roots of unity $\omega^j$, $j=0,1,\ldots,r-1$, with $\omega = \exp(2\pi i/r)$. We use the weight…

Let H, K be subgroups of G. We investigate the intersection properties of left and right cosets of these subgroups.

Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the…

The reaction e+e- -> e+e- gamma* gamma* -> e+e- hadrons for quasi-real photons is studied using data from root(s) = 183 GeV up to 202 GeV. Results on the total cross sections sigma(e+e- -> e+e- hadrons) and sigma(+e- gamma* gamma* -> e+e-…

We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…