相关论文: Cross-sections of multibrot sets
In this paper we show that a nodal complete intersection threefold $X$ in $\mathbb{P}^{3+c}$ with defect, but without induced defect, has at least $\sum_{i\leq j} (d_i-1)(d_j-1)$ nodes, provided either $c=2$ or $d_c>\sum_{i=1}^{c-1} d_i$…
In this paper we study two directions of extending the classical Erd\H os-Ko-Rado theorem which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…
In this note, we first bound the intersection number of the regular simplicial partitions.
In this paper, we generalize the so called Korchm\'aros--Mazzocca arcs, that is, point sets of size $q+t$ intersecting each line in $0, 2$ or $t$ points in a finite projective plane of order $q$. For $t\neq 2$, this means that each point of…
Minor changes in the exposition and small corrections on the previous version.
We prove an intersection formula for two plane branches in terms of their semigroups and key polynomials. Then we provide a strong version of Bayer's theorem on the set of intersection numbers of two branches and apply it to the logarithmic…
The process e+ e- -> n gamma with n>=2 is studied at centre-of-mass energies ranging from \root(s)=192 to 208 GeV. The data sample corresponds to a total integrated luminosity of 427 1/pb. The total and differential cross sections are found…
This thesis is divided into two parts, each of which supports constructing and using a lithium magneto-optical trap for cold collision studies: Part I: One outgoing channel of interest from cold collisions is the production of ion pairs. We…
We give a complete characterization of mixed unit interval graphs, the intersection graphs of closed, open, and half-open unit intervals of the real line. This is a proper superclass of the well known unit interval graphs. Our result solves…
We find that energy surfaces of more than two atoms or molecules interacting via dipole-dipole po- tentials generically possess conical intersections (CIs). Typically only few atoms participate strongly in such an intersection. For the…
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
There is presented a method for computing the algebraic number of cross-cap singularities for mapping from m dimensional compact manifold with boundary M into R^(2m-1), m is odd. As an application, the intersection number of an immersion g…
A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be cross-intersecting if each set in $\mathcal{A}$ intersects each set in…
A bijection is given between multi-edge trees and 3-coloured Motzkin paths.
The high resolution rovibronic line list of MgH+ molecular cation are presented in our work. The potential energy curves are calculated by the method of multireference configuration interaction plus Davidson correction (MRCI+Q) and…
In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…
We study the orbits of a polynomial f in C[X], namely the sets {e,f(e),f(f(e)),...} with e in C. We prove that if nonlinear complex polynomials f and g have orbits with infinite intersection, then f and g have a common iterate. More…
A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…
The first part of this article is devoted to the study families of totally real intersecting $n$-submanifolds of $(\Bbb C^n,0)$. We give some conditions which allow to straighten holomorphically the family. If this is not possible to do it…
Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…