相关论文: A diffusion generated method for computing Dirichl…

This paper introduces a novel, robust, and computationally efficient framework for high-quality quadrilateral mesh generation on general two-dimensional domains. The core of the proposed approach is a novel method for computing cross fields…

Here we present four independent advances which facilitate the computation of phonons and their interactions from first-principles. First, we implement a group-theoretical approach to construct the order N Taylor series of a d-dimensional…

For a 4-manifold $M$ and a knot $k\colon\mathbb{S}^1\hookrightarrow\partial M$ with dual sphere $G\colon\mathbb{S}^2\hookrightarrow\partial M$, we compute the set $\mathbb{D}(M;k)$ of smooth isotopy classes of neat embeddings…

Two-dimensional mixtures of dipolar colloidal particles with different dipole moments exhibit extremely rich self-assembly behaviour and are relevant to a wide range of experimental systems, including charged and super-paramagnetic colloids…

We compute the Donaldson-Thomas invariants of a local elliptic surface with section. We introduce a new computational technique which is a mixture of motivic and toric methods. This allows us to write the partition function for the…

The Hermite-Birkhoff interpolation problem of a function given on arbitrarily distributed points on the sphere and other manifolds is considered. Each proposed interpolant is expressed as a linear combination of basis functions, the…

The aim of this paper is to analyse the gain of the update algorithm associated to the recently proposed D-iteration: the D-iteration is a fluid diffusion based new iterative method. It exploits a simple intuitive decomposition of the…

Development generating diffraction-related valuable expressions and formulas capable of initiating new era for diffraction and for scientific domains that use it provided. The main expression, among these, gives diffracted intensity as…

We show that if we suppose n>3 and the (2n-1)-stem in the stable homotopy groups of spheres has no 2-torsion, then the Whitehead squares of the identity maps of (2n+1) and (4n+3)-spheres are divisible by 2. Applying the result of G. Wang…

We introduce a new class of multilevel, adaptive, dual-space methods for computing fast convolutional transforms. These methods can be applied to a broad class of kernels, from the Green's functions for classical partial differential…

We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give…

We obtain simple quadratic recurrence formulas counting bipartite maps on surfaces with prescribed degrees (in particular, $2k$-angulations), and constellations. These formulas are the fastest known way of computing these numbers. Our work…

In this paper we complete the derivations of finite volume partition functions for QCD using random matrix theories by calculating the effective low-energy partition function for three-dimensional QCD in the adjoint representation from a…

We construct a pair of related diffusions on a space of interval partitions of the unit interval $[0,1]$ that are stationary with the Poisson-Dirichlet laws with parameters (1/2,0) and (1/2,1/2) respectively. These are two particular cases…

\textit{Ab initio} calculations have been performed on hexagonal layers of M$_2$O$_3$ (M being several transition metals of the $5d$ series) sandwiched by a band insulator such as Al$_2$O$_3$ that provides the honeycomb lattice where the…

A modified set of Mosseri-Sadoc (MS) tiles tessellating 3D Euclidean space with icosahedral symmetry is introduced. The new set of tiles are embedded in dodecahedron with a threefold symmetric order. The modified Mosseri-Sadoc (MMS) tiles…

In this work, we present two parallel algorithms for the large-scale discrete Fourier transform (DFT) on Tensor Processing Unit (TPU) clusters. The two parallel algorithms are associated with two formulations of DFT: one is based on the…

In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which generalize both the classical partition function and the partition diamonds of Andrews, Paule and Riese, and we set $r_d(n)$ to be their counting…

A framework is developed for a robust and highly accurate numerical solution of the coupled Stokes-Darcy system in three dimensions. The domain decomposition method is based on a Dirichlet-Neumann type splitting of the interface conditions…

We prove that the planar hexagonal honeycomb is asymptotically optimal for a large class of optimal partition problems, in which the cells are assumed to be convex, and the criterion is to minimize either the sum or the maximum among the…