Related papers: From linear programming to colliding particles
Powdered materials of sizes ranging from nanometers to microns are widely used in materials science and are carefully selected to enhance the performance of a matrix. Fillers have been used in order to improve, among the others, mechanical,…
After introducing the definitions of positive, negative and companion rules, from a given pair of companion rules we construct a new rule with higher degree of precision The scheme is generalized giving rise to a transformation which we…
We report adaptive resolution molecular dynamics simulations of a flexible linear polymer in solution. The solvent, i.e., a liquid of tetrahedral molecules, is represented within a certain radius from the polymer's center of mass with a…
Building structures with hierarchical order through the self-assembly of smaller blocks is not only a prerogative of nature, but also a strategy to design artificial materials with tailored functions. We explore in simulation the…
We propose a general impulsive model for scattering of molecules from a flat solid surface. It is assumed within the framework of this model that an encounter of an atom (or ion) with the surface is a series of elastic (in the direction…
We consider the polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less…
This study presents an innovative direct numerical simulation approach for complex particle systems with irregular shapes and large numbers. Using partially saturated methods, it accurately models arbitrary shapes, albeit at considerable…
We investigate the phase diagram of disordered copolymers at the interface between two selective solvents, and in particular its weak-coupling behavior, encoded in the slope $m_c$ of the critical line at the origin. In mathematical terms,…
This paper presents a novel method for the reconstruction of interaction vertices in particle collision data. The algorithm is an agglomerative clustering technique designed for high-luminosity environments in current and future…
We present a new model which represents data as a mixture of simplices. Simplices are geometric structures that generalize triangles. We give a simple geometric understanding that allows us to learn a simplicial structure efficiently. Our…
Many suspensions contain particles with complex shapes that are affected not only by hydrodynamics, but also by thermal fluctuations, internal kinematic constraints and other long-range non-hydrodynamic interactions. Modeling these systems…
Collision detection of a large number N of particles can be challenging. Directly testing N particles for collision among each other leads to N 2 queries. Especially in scenarios, where fast, densely packed particles interact, challenges…
A simple relation is developed between elastic collisions of freely-moving point particles in one dimension and a corresponding billiard system. For two particles with masses m_1 and m_2 on the half-line x>0 that approach an elastic barrier…
Discrete simulation methods are efficient tools to investigate the complex behaviors of complex fluids made of either dry granular materials or dilute suspensions. By contrast, materials made of soft and/or concentrated units (emulsions,…
Node elimination is a numerical approach to obtain cubature rules for the approximation of multivariate integrals. Beginning with a known cubature rule, nodes are selected for elimination, and a new, more efficient rule is constructed by…
Transport phenomena in complex and dynamic microscopic environments are fundamentally shaped by hydrodynamic interactions. In particular, microparticle transport in porous media is governed by the delicate interplay between…
We give a decomposition of the suspension of a polyhedral join in terms of the polyhedral smash product of the suspension of the family of pairs, and study some cases in which the formula can be desuspended, particularly for polyhedral…
In their paper proving the Hirsch bound for flag normal simplicial complexes (Math. Oper.~Res.~2014) Adiprasito and Benedetti define the notion of~\emph{combinatorial segment}. The study of the maximal length of these objects provides the…
The max-cut problem is a classical graph theory problem which is NP-complete. The best polynomial time approximation scheme relies on \emph{semidefinite programming} (SDP). We study the conditions under which graphs of certain classes have…
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the…