Related papers: The Diamond ensemble: a constructive set of points…
An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…
We introduce a concept of rings of right (left) almost stable range $1$ and we construct a theory of a canonical diagonal reduction of matrices over such rings. A description of new classes of noncommutative elementary divisor rings is done…
We introduce notions of vector field and its (discrete time) flow on a chain complex. The resulting dynamical systems theory provides a set of tools with a broad range of applicability that allow, among others, to replace in a canonical way…
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
We consider a family of determinantal random point processes on the two-dimensional lattice and prove that members of our family can be interpreted as a kind of Gibbs ensembles of nonintersecting paths. Examples include probability measures…
The reachable set for a finite dimensional quantum system is shown to be the orbit of the group corresponding to the internal and control Hamiltonians, even if this group is not compact.
Diamondynes, a new class of diamond-like carbon allotropes composed of carbon with sp$^2$/sp$^3$-hybridized carbon networks, exhibit unique structural motifs that have not been previously reported in carbon materials. These architectures…
In \cite{W}, there is a graphic description of any irreducible, finite dimensional $\mathfrak{sl}(3)$ module. This construction, called diamond representation is very simple and can be easily extended to the space of irreducible finite…
The mixed spherical models were recently found to violate long-held assumptions about mean-field glassy dynamics. In particular, the threshold energy, where most stationary points are marginal and that in the simpler pure models attracts…
Recently, it became possible to experimentally generate and characterize a very thin silica system on a substrate which can be basically described as a 2D random network. The key structural properties, in particular related to the ring…
We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this…
By studying the structures of clusters bound by a model potential that favours polytetrahedral order, we find a previously unknown series of `magic numbers' (i.e. sizes of special stability) whose polytetrahedral structures are…
Each monomial ideal over a polynomial ring admits a free resolution which has the structure of a DG-algebra, namely, the Taylor resolution. A pivot resolution of a monomial ideal, which we introduce, is a resolution that is always shorter…
Dynamical systems are a broad class of mathematical tools used to describe the evolution of physical and computational processes. Traditionally these processes model changing entities in a static world. Picture a ball rolling on an empty…
For a symmetric Hamiltonian system, lower bounds for the number of relative equilibria surrounding stable and formally unstable relative equilibria on nearby energy levels are given.
Symmetry-determined nonlinear normal modes, which describe large-amplitude vibrations of diamond lattice, are studied by specific group-theoretical methods. For two of these modes, corresponding to vibrational state with and without…
Scientists often think of the world (or some part of it) as a dynamical system, a stochastic process, or a generalization of such a system. Prominent examples of systems are (i) the system of planets orbiting the sun or any other classical…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…
Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…
This work identifies a solvable (in the sense that spectral correlation functions can be expressed in terms of orthogonal polynomials), rotationally invariant random matrix ensemble with a logarithmic weakly confining potential. The…