Related papers: Intersection of paraboloids and application to Min…
Earlier we have shown that interacting electron-positron and electromagnetic fields can be considered as a certain microscopic distortion of pseudo-Euclidean properties of the Minkovsky 4-space-time. The known Dirac and Maxwell equations…
The four center integrals needed in the Hartree Fock approximation and in TDDFT linear response are known to be difficult to calculate for orbitals of the Slater type or of finite range. We show that the interaction of pairs of products…
We study a possible realization of the position- and momentum-correlated atomic pairs that are confined to adjacent sites of two mutually shifted optical lattices and are entangled via laser-induced dipole-dipole interactions. The…
Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…
We study global solutions to the thin obstacle problem with at most quadratic growth at infinity. We show that every ellipsoid can be realized as the contact set of such a solution. On the other hand, if such a solution has a compact…
While well-known methods to list the intersections of either a list of segments or a complex polygon aim at achieving optimal time-complexity they often do so at the cost of memory comsumption and complex code. Real-life software…
The focus of this paper is on a thin obstacle problem where the obstacle is defined on the intersection between a hyper-plane $\Gamma$ in $\mathbb{R}^n$ and a periodic perforation $\mathcal{T}_\varepsilon$ of $\mathbb{R}^n$, depending on a…
We present an algorithm for evaluating a linear ``intersection transform'' of a function defined on the lattice of subsets of an $n$-element set. In particular, the algorithm constructs an arithmetic circuit for evaluating the transform in…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
A numerical technique is described that can efficiently compute solutions in interface problems. These are problems with data, such as the coefficients of differential equations, discontinuous or even singular across one or more interfaces.…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
We consider the problem of computing, given a set S of n points in the plane, which points of S are vertices of the convex hull of S. For certain variations of this problem, different proofs exist that the complexity of this problem in the…
The authors) Whenever light is slowed down, for any cause, two different formulas give its momentum. For dielectrics, the coexistence of those momenta was the heart of the century-old Abraham-Minkowski dilemma, recently resolved. We…
In this paper, we study the orbit intersection problem for the linear space and the algebraic group in positive characteristic. Let $K$ be an algebraically closed field of positive characteristic and let $\Phi_1, \Phi_{2}: K^d…
The two-particle momentum correlation between the Omega-baryon ($\Omega$) and the $^{4}He (\alpha) $ in high-energy heavy ion collisions is explored. Such correlations as an alternative source of information can help us further understand…
We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…
UU collisions can provide about 30% larger densities compared to central PbPb ones. New aspect is generation of rather deformed initial states. We show that those can be effectively used to resolve a number of outstanding issues, from…
We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…
In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas…
Let $Y$ be a hyperbolic surface and let $\phi$ be a Laplacian eigenfunction having eigenvalue $-1/4-\tau^2$ with $\tau>0$. Let $N(\phi)$ be the set of nodal lines of $\phi$. For a fixed analytic curve $\gamma$ of finite length, we study the…