Search

We consider the radius of gyration of a Gaussian topological polymer $G$ formed by subdividing a graph $G'$ of arbitrary topology (for instance, branched or multicyclic). We give a new exact formula for the expected radius of gyration and contraction factor of $G$ in terms of the number of subdivisions of each edge of $G'$ and a new weighted Kirchhoff index for $G'$. The formula explains and extends previous results for the contraction factor and Kirchhoff index of subdivided graphs.

Suppose we have an embedding of a graph $\mathbf{G}$ created by subdividing the edges of a simpler graph $\mathbf{G'}$. The edges of $\mathbf{G}$ can be divided into subsets which join pairs of ``junction'' vertices in $\mathbf{G'}$. The displacement vectors of the edges in each subset sum to the displacement between junctions. We can construct a family of embeddings of $\mathbf{G}$ with the same junction positions by rearranging the displacements in each group. In this paper, we show that the average (squared) radius of gyration of these embeddings is given by a simple formula involving a weighted (squared) radius of gyration of the positions of the junctions and the sum of the squares of the lengths of the edges of $\mathbf{G}$ and $\mathbf{G'}$. This ensemble of graph embeddings arises naturally in polymer science., Comment: 19 pages, 3 figures

The DA{\Phi}NE operations during the last year have been devoted to deliver a statistically significant data sample to perform the first-ever measurement of kaonic deuterium X-ray transitions to the fundamental level. Operations for the SIDDHARTA-2 detector using a deuterium gas target started officially on the second half of May 2023, and have been organized in several runs here described., Comment: 7 pages, 3 figures, prepared for the INFN Laboratori Nazionali di Frascati 2023 activity report

We present the first algorithm for sampling random configurations of closed $n$-gons with any fixed edgelengths $r_1, \dots, r_n$ in any dimension $d$ which is proved to sample correctly from standard probability measures on these spaces. We generate open $n$-gons as weighted sets of edge vectors on the unit sphere and close them by taking a M\"obius transformation of the sphere which moves the center of mass of the edges to the origin. Using previous results of the authors, such a M\"obius transformation can be found in $O(n)$ time. The resulting closed polygons are distributed according to a pushforward measure. The main contribution of the present paper is the explicit calculation of reweighting factors which transform this pushforward measure to any one of a family of standard measures on closed polygon space, including the symplectic volume for polygons in $\mathbb{R}^3$. For fixed dimension, these reweighting factors may be computed in $O(n)$ time. Experimental results show that our algorithm is efficient and accurate in practice, and an open-source reference implementation is provided., Comment: 27 pages, 8 figures

We present a faster direct sampling algorithm for random equilateral closed polygons in three-dimensional space. This method improves on the moment polytope sampling algorithm of Cantarella, Duplantier, Shonkwiler, and Uehara (2016) and has (expected) time per sample quadratic in the number of edges in the polygon. We use our new sampling method and a new code for computing invariants based on the Alexander polynomial to investigate the probability of finding unknots among equilateral closed polygons., Comment: 12 pages, 4 figures. This version includes a table of estimated unknot probabilities for equilateral polygons from 16 to 3043 edges, and an additional data file "unknot-inverse-samples.tsv" giving the raw data from our experiment

TEX facility if commissioned for high power testing to characterize accelerating structures and validate them for the operation on future particle accelerators for medical, industrial and research applications. At this aim, TEX is directly involved in the LNF leading project EuPRAXIA@SPARC_Lab. The brief description of the facility and its status and prospective will be provided., Comment: Talk presented at the International Workshop on Future Linear Colliders (LCWS 2023), 15-19 May 2023. C23-05-15.3

In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects, Lennard-Jones potentials, bending energies, and other physically realistic models. A configuration of $n$ monomers in $\mathbb{R}^d$ can be written as a collection of $d$ coordinate vectors, each in $\mathbb{R}^n$. Our first main result is that entries from different coordinate vectors are uncorrelated, even when they are different coordinates of the same monomer. We predict that this property holds in realistic simulations and in actual polymer configurations (in the absence of an external field). Our second main contribution is a theorem explaining when and how a probability distribution on embeddings of a complicated graph may be pushed forward to a distribution on embeddings of a simpler graph to aid in computations. This construction is based on the idea of chain maps in homology theory. We use it to give a new formula for edge covariances in phantom network theory and to compute some expectations for a freely-jointed network., Comment: 37 pages, 4 figures

In the last 20 years, over 600 impact flashes have been documented on the lunar surface. This wealth of data presents a unique opportunity to study the meteoroid flux of the Earth-Moon environment, and in recent years the physical properties of the impactors. However, other than through serendipitous events, there has not been yet a systematic search and discovery of the craters associated to these events. Such a meteoroid-crater link would allow us to get insight into the crater formation via these live observations of collisions. Here we present the PyNAPLE (Python NAC Automated Pair Lunar Evaluator) software pipeline for locating newly formed craters using the location and epoch of an observed impact flash. We present the first results from PyNAPLE, having been implemented on the 2017-09-27 impact flash. A rudimentary analysis on the impact flash and linked impact crater is also performed, finding that the crater's ejecta pattern indicates an impact angle between 10-30 degree, and although the rim-to-rim diameter of the crater is not resolvable in current LRO NAC images, using crater scaling laws we predict this diameter to be 24.1-55.3 m, and using ejecta scaling predict a diameter of 27.3-37.7 m. We discuss how PyNAPLE will enable large scale analyses of sub-kilometer scale cratering rates and refinement of both scaling laws, and the luminous efficiency.

Let $\Delta$ denote a non-degenerate $k$-simplex in $\mathbb{R}^k$. The set $\text{Sim}(\Delta)$ of simplices in $\mathbb{R}^k$ similar to $\Delta$ is diffeomorphic to $O(k)\times [0,\infty)\times \mathbb{R}^k$, where the factor in $O(k)$ is a matrix called the {\em pose}. Among $(k-1)$-spheres smoothly embedded in $\mathbb{R}^k$ and isotopic to the identity, there is a dense family of spheres, for which the subset of $\text{Sim}(\Delta)$ of simplices inscribed in each embedded sphere contains a similar simplex of every pose $U\in O(k)$. Further, the intersection of $\text{Sim}(\Delta)$ with the configuration space of $k+1$ distinct points on an embedded sphere is a manifold whose top homology class maps to the top class in $O(k)$ via the pose map. This gives a high dimensional generalization of classical results on inscribing families of triangles in plane curves. We use techniques established in our previous paper on the square-peg problem where we viewed inscribed simplices in spheres as transverse intersections of submanifolds of compactified configuration spaces., Comment: 20 pages, 2 figures. arXiv admin note: text overlap with arXiv:2103.07506 New version has correct term for $k$-simplex and other minor corrections

The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for various regularity classes of curves between continuous and $C^1$-smooth Jordan curves. Here, in a generalization of the square-peg problem, we consider embedded curves in space, and ask if they have inscribed quadrilaterals with equal sides and equal diagonals. We call these quadrilaterals "square-like". We give a regularity class (finite total curvature without cusps) in which we can prove that every embedded curve has an inscribed square-like quadrilateral. The key idea is to use local data to show that short enough arcs have small curvature, thus ruling out small squares. This allows us to successfully use a limiting argument on approximating curves., Comment: 11 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:1402.6174

We prove a transversality "lifting property" for compactified configuration spaces as an application of the multijet transversality theorem: given a submanifold of configurations of points on an embedding of a compact manifold $M$ in Euclidean space, we can find a dense set of smooth embeddings of $M$ for which the corresponding configuration space of points is transverse to any submanifold of the configuration space of points in Euclidean space, as long as the two submanifolds of compactified configuration space are boundary-disjoint. We use this setup to provide an attractive proof of the square-peg problem: there is a dense family of smoothly embedded circles in the plane where each simple closed curve has an odd number of inscribed squares, and there is a dense family of smoothly embedded circles in $\mathbb{R}^n$ where each simple closed curve has an odd number of inscribed square-like quadrilaterals., Comment: 30 pages, 4 figures. arXiv admin note: text overlap with arXiv:1402.6174. Version 2 corrects some minor errors

The financial and economic crisis recently experienced by many European countries has increased demand for timely, coherent and consistent distributional information for the household sector. In the Euro area, most of the NCBs collect such information through income and wealth surveys, which are often used to inform their decisions. These surveys, however, can often suffer from biases, usually caused by non-response and under-reporting behaviours, leading to a mismatch with macroeconomic aggregates. In this paper, we develop a novel allocation method which combines information from a power law (Pareto) model and imputation procedures so to address these issues simultaneously, when only limited external information is available. We provide two important contributions: first, we adjust the weights of observed survey households for non-response bias, then, we correct for measurement error. Finally, we produce distributional indicators for four Euro-Area countries.

The discovery of knotting in proteins and other macromolecular chains has motivated researchers to more carefully consider how to identify and classify knots in open arcs. Most definitions classify knotting in open arcs by constructing an ensemble of closures and measuring the probability of different knot types among these closures. In this paper, we think of assigning knot types to open curves as a classification problem and compare the performance of the Bayes MAP classifier to the standard Uniform Closure Method. Surprisingly, we find that both methods are essentially equivalent as classifiers, having comparable accuracy and positive predictive value across a wide range of input arc lengths and knot types., Comment: 21 pages, 5 figures, 2 tables

We consider the topologically constrained random walk model for topological polymers. In this model, the polymer forms an arbitrary graph whose edges are selected from an appropriate multivariate Gaussian which takes into account the constraints imposed by the graph type. We recover the result that the expected radius of gyration can be given exactly in terms of the Kirchhoff index of the graph. We then consider the expected radius of gyration of a topological polymer whose edges are subdivided into $n$ pieces. We prove that the contraction factor of a subdivided polymer approaches a limit as the number of subdivisions increases, and compute the limit exactly in terms of the degree-Kirchhoff index of the original graph. This limit corresponds to the thermodynamic limit in statistical mechanics and is fundamental in the physics of topological polymers. Furthermore, these asymptotic contraction factors are shown to fit well with molecular dynamics simulations., Comment: Added more context and made some other minor revisions. 22 pages, 4 figures

The conformal barycenter of a point cloud on the sphere at infinity of the Poincar\'e ball model of hyperbolic space is a hyperbolic analogue of the geometric median of a point cloud in Euclidean space. It was defined by Douady and Earle as part of a construction of a conformally natural way to extend homeomorphisms of the circle to homeomorphisms of the disk, and it plays a central role in Millson and Kapovich's model of the configuration space of cyclic linkages with fixed edgelengths. In this paper we consider the problem of computing the conformal barycenter. Abikoff and Ye have given an iterative algorithm for measures on $\mathbb{S}^1$ which is guaranteed to converge. We analyze Riemannian versions of Newton's method computed in the intrinsic geometry of the Poincare ball model. We give Newton-Kantorovich (NK) conditions under which we show that Newton's method with fixed step size is guaranteed to converge quadratically to the conformal barycenter for measures on any $\mathbb{S}^d$ (including infinite-dimensional spheres). For measures given by $n$ atoms on a finite dimensional sphere which obey the NK conditions, we give an explicit linear bound on the computation time required to approximate the conformal barycenter to fixed error. We prove that our NK conditions hold for all but exponentially few $n$ atom measures. For all measures with a unique conformal barycenter we show that a regularized Newton's method with line search will always converge (eventually superlinearly) to the conformal barycenter. Though we do not have hard time bounds for this algorithm, experiments show that it is extremely efficient in practice and in particular much faster than the Abikoff-Ye iteration., Comment: 29 pages, 8 figures

This paper generalizes the Gaussian random walk and Gaussian random polygon models for linear and ring polymers to polymer topologies specified by an arbitrary multigraph $G$. Probability distributions of monomer positions and edge displacements are given explicitly and the spectrum of the graph Laplacian of $G$ is shown to predict the geometry of the configurations. This provides a new perspective on the James-Guth-Flory theory of phantom elastic networks. The model is based on linear algebra motivated by ideas from homology and cohomology theory. It provides a robust theoretical foundation for more detailed models of topological polymers., Comment: 12 pages, 3 figures

In this paper, we consider fixed edgelength $n$-step random walks in $\mathbb{R}^d$. We give an explicit construction for the closest closed equilateral random walk to almost any open equilateral random walk based on the geometric median, providing a natural map from open polygons to closed polygons of the same edgelength. Using this, we first prove that a natural reconfiguration distance to closure converges in distribution to a Nakagami$(\frac{d}{2},\frac{d}{d-1})$ random variable as $n \rightarrow \infty$. We then strengthen this to an explicit probabilistic bound on the distance to closure for a random $n$-gon in any dimension with any collection of fixed edgelengths $w_i$. Numerical evidence supports the conjecture that our closure map pushes forward the natural probability measure on open polygons to something very close to the natural probability measure on closed polygons; if this is so, we can draw some conclusions about the frequency of local knots in closed polygons of fixed edgelength., Comment: 28 pages, 6 figures

On the wake of the results obtained so far at the SPARC\_LAB test-facility at the Laboratori Nazionali di Frascati (Italy), we are currently investigating the possibility to design and build a new multi-disciplinary user-facility, equipped with a soft X-ray Free Electron Laser (FEL) driven by a $\sim$1 GeV high brightness linac based on plasma accelerator modules. This design study is performed in synergy with the EuPRAXIA design study. In this paper we report about the recent progresses in the on going design study of the new facility.

In this paper, we introduce a new type of relation between knots called the descendant relation. One knot $H$ is a descendant of another knot $K$ if $H$ can be obtained from a minimal crossing diagram of $K$ by some number of crossing changes. We explore properties of the descendant relation and study how certain knots are related, paying particular attention to those knots, called fertile knots, that have a large number of descendants. Furthermore, we provide computational data related to various notions of knot fertility and propose several open questions for future exploration., Comment: 20 pages, 11 figures, 14 tables

We consider the problem of finding the probability that a random triangle is obtuse, which was first raised by Lewis Caroll. Our investigation leads us to a natural correspondence between plane polygons and the Grassmann manifold of 2-planes in real $n$-space proposed by Allen Knutson and Jean-Claude Hausmann. This correspondence defines a natural probability measure on plane polygons. In these terms, we answer Caroll's question. We then explore the Grassmannian geometry of planar quadrilaterals, providing an answer to Sylvester's four-point problem, and describing explicitly the moduli space of unordered quadrilaterals. All of this provides a concrete introduction to a family of metrics used in shape classification and computer vision., Comment: 24 pages, 4 figures