arXiv subjects

Eric Jankowski

Publications and source records attributed to Eric Jankowski.

8 recordsLinked to original sources

arXiv2025

Invertible sheaves and $Π$-invertible sheaves on the isomeric supergrassmannian and its toric subvarieties

We provide an elementary proof that with the exceptions of certain $Π$-projective spaces, both the Picard group and the $Π$-Picard set of the isomeric (i.e. type-Q) supergrassmannian are trivial. We extend this technique to show that the Picard group and the $Π$-Picard set of a supertorus orbit closure within the isomeric supergrassmannian can be easily calculated from its defining polytope by counting the number of simplex factors. Since the presence of nontrivial invertible sheaves and $Π$-invertible sheaves depends entirely on factors of $Π$-projective space, we construct them as symmetric powers of the tautological sheaf and its dual.

math.AG↗

arXiv2025

Reduced superschemes and the combinatorics of toric supervarieties

We propose new definitions of integral, reduced, and normal superrings and superschemes to properly establish the notion of a supervariety. We generalize several results about classical reduced rings and varieties to the supergeometric setting, including an equivalence of categories between certain toric supervarieties and decorated polyhedral fans. These decorated fans are shown to encode important geometric information about the corresponding toric supervarieties. We then investigate some naturally-occurring toric supervarieties inside the isomeric supergrassmannian, which we show admits a nice description as a decorated polytope.

math.AG↗

arXiv2023

Toric supervarieties with one odd dimension

In this paper we describe the notion of a toric supervariety, generalizing that of a toric variety from the classical setting. We give a combinatorial interpretation of the category of quasinormal toric supervarieties with one odd dimension using decorated polyhedral fans. We then use this interpretation to calculate some invariants of these supervarieties and extract geometric information from them.

math.AG↗

arXiv2019

Spectra of Convex Hulls of Matrix Groups

The still-unsolved problem of determining the set of eigenvalues realized by $n$-by-$n$ doubly stochastic matrices, those matrices with row sums and column sums equal to $1$, has attracted much attention in the last century. This problem is somewhat algebraic in nature, due to a result of Birkhoff demonstrating that the set of doubly stochastic matrices is the convex hull of the permutation matrices. Here we are interested in a general matrix group $G \subseteq GL_n(\mathbb{C})$ and the hull spectrum $\text{HS}(G)$ of eigenvalues realized by convex combinations of elements of $G$. We show that hull spectra of matrix groups share many nice properties. Moreover, we give bounds on the hull spectra of matrix groups, determine $\text{HS}(G)$ exactly for important classes of matrix groups, and study the hull spectra of representations of abstract groups.

math.SP↗

arXiv2019

Eigenvalue Paths Arising From Matrix Paths

It is known (see e.g. [2], [4], [5], [6]) that continuous variations in the entries of a complex square matrix induce continuous variations in its eigenvalues. If such a variation arises from one real parameter $α\in [0, 1]$, then the eigenvalues follow continuous paths in the complex plane as $α$ shifts from $0$ to $1$. The intent here is to study the nature of these eigenpaths, including their behavior under small perturbations of the matrix variations, as well as the resulting eigenpairings of the matrices that occur at $α = 0$ and $α = 1$. We also give analogs of our results in the setting of monic polynomials.

math.SP↗

arXiv2013

Massively parallel Monte Carlo for many-particle simulations on GPUs

Current trends in parallel processors call for the design of efficient massively parallel algorithms for scientific computing. Parallel algorithms for Monte Carlo simulations of thermodynamic ensembles of particles have received little attention because of the inherent serial nature of the statistical sampling. In this paper, we present a massively parallel method that obeys detailed balance and implement it for a system of hard disks on the GPU. We reproduce results of serial high-precision Monte Carlo runs to verify the method. This is a good test case because the hard disk equation of state over the range where the liquid transforms into the solid is particularly sensitive to small deviations away from the balance conditions. On a Tesla K20, our GPU implementation executes over one billion trial moves per second, which is 148 times faster than on a single Intel Xeon E5540 CPU core, enables 27 times better performance per dollar, and cuts energy usage by a factor of 13. With this improved performance we are able to calculate the equation of state for systems of up to one million hard disks. These large system sizes are required in order to probe the nature of the melting transition, which has been debated for the last forty years. In this paper we present the details of our computational method, and discuss the thermodynamics of hard disks separately in a companion paper.

physics.comp-ph↗

arXiv2012

Self Assembled Clusters of Spheres Related to Spherical Codes

We consider the thermodynamically driven self-assembly of spheres onto the surface of a central sphere. This assembly process forms self-limiting, or terminal, anisotropic clusters (N-clusters) with well defined structures. We use Brownian dynamics to model the assembly of N-clusters varying in size from two to twelve outer spheres, and free energy calculations to predict the expected cluster sizes and shapes as a function of temperature and inner particle diameter. We show that the arrangements of outer spheres at finite temperatures are related to spherical codes, an ideal mathematical sequence of points corresponding to densest possible sphere packings. We demonstrate that temperature and the ratio of the diameters of the inner and outer spheres dictate cluster morphology and dynamics. We find that some N-clusters exhibit collective particle rearrangements, and these collective modes are unique to a given cluster size N. We present a surprising result for the equilibrium structure of a 5-cluster, which prefers an asymmetric square pyramid arrangement over a more symmetric arrangement. Our results suggest a promising way to assemble anisotropic building blocks from constituent colloidal spheres.

cond-mat.soft↗

arXiv2011

Thermal and Athermal Swarms of Self-Propelled Particles

Swarms of self-propelled particles exhibit complex behavior that can arise from simple models, with large changes in swarm behavior resulting from small changes in model parameters. We investigate the steady-state swarms formed by self-propelled Morse particles in three dimensions using molecular dynamics simulations optimized for GPUs. We find a variety of swarms of different overall shape assemble spontaneously and that for certain Morse potential parameters coexisting structures are observed. We report a rich "phase diagram" of athermal swarm structures observed across a broad range of interaction parameters. Unlike the structures formed in equilibrium self-assembly, we find that the probability of forming a self-propelled swarm can be biased by the choice of initial conditions. We investigate how thermal noise influences swarm formation and demonstrate ways it can be exploited to reconfigure one swarm into another. Our findings validate and extend previous observations of self-propelled Morse swarms and highlight open questions for predictive theories of nonequilibrium self-assembly.

cond-mat.soft↗