An official website of the United States government
An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of atoms (counting repetitions) in the corresponding sum is called the length of the factorization. Following Geroldinger and Zhong, we say that an atomic monoid M is a length-finite factorization monoid if each b ∈ M has only finitely many factorizations of any prescribed length. An additive submonoid of ℝ≥0 is called a positive monoid. Factorizations in positive monoids have been actively studied in recent years. The main purpose of this paper is to give a better understanding of the non-unique factorization phenomenon in positive monoids through the lens of the length-finite factorization property. To do so, we identify a large class of positive monoids which satisfy the length-finite factorization property. Then we compare the length-finite factorization property to the bounded and the finite factorization properties, which are two properties that have been systematically investigated for more than thirty years.
more »
« less
Cartesian Operator Factorization Method for Hydrogen
We generalize Schrödinger’s factorization method for Hydrogen from the conventional separation into angular and radial coordinates to a Cartesian-based factorization. Unique to this approach is the fact that the Hamiltonian is represented as a sum over factorizations in terms of coupled operators that depend on the coordinates and momenta in each Cartesian direction. We determine the eigenstates and energies, the wavefunctions in both coordinate and momentum space, and we also illustrate how this technique can be employed to develop the conventional confluent hypergeometric equation approach. The methodology developed here could potentially be employed for other Hamiltonians that can be represented as the sum over coupled Schrödinger factorizations.
more »
« less
- PAR ID:
- 10343033
- Date Published:
- Journal Name:
- Atoms
- Volume:
- 10
- Issue:
- 1
- ISSN:
- 2218-2004
- Page Range / eLocation ID:
- 14
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Consider a pair of elementsfandgin a commutative ringQ. Given a matrix factorization offand another ofg, the tensor product of matrix factorizations, which was first introduced by Knörrer and later generalized by Yoshino, produces a matrix factorization of the sum$$f+g$$. We will study the tensor product ofd-fold matrix factorizations, with a particular emphasis on understanding when the construction has a non-trivial direct sum decomposition. As an application of our results, we construct indecomposable maximal Cohen–Macaulay and Ulrich modules over hypersurface domains of a certain form.more » « less
-
We present an efficient voxelization method to encode the geometry and attributes of 3D point clouds obtained from autonomous vehicles. Due to the circular scanning trajectory of sensors, the geometry of LiDAR point clouds is inherently different from that of point clouds captured from RGBD cameras. Our method exploits these specific properties to representing points in cylindrical coordinates instead of conventional Cartesian coordinates. We demonstrate that Region Adaptive Hierarchical Transform (RAHT) can be extended to this setting, leading to attribute encoding based on a volumetric partition in cylindrical coordinates. Experimental results show that our proposed voxelization outperforms conventional approaches based on Cartesian coordinates for this type of data. We observe a significant improvement in attribute coding performance with 5-10% reduction in bitrate and octree representation with 35-45% reduction in bits.more » « less
-
null (Ed.)SUMMARY Within the field of seismic modelling in anisotropic media, dynamic ray tracing is a powerful technique for computation of amplitude and phase properties of the high-frequency Green’s function. Dynamic ray tracing is based on solving a system of Hamilton–Jacobi perturbation equations, which may be expressed in different 3-D coordinate systems. We consider two particular coordinate systems; a Cartesian coordinate system with a fixed origin and a curvilinear ray-centred coordinate system associated with a reference ray. For each system we form the corresponding 6-D phase spaces, which encapsulate six degrees of freedom in the variation of position and momentum. The formulation of (conventional) dynamic ray tracing in ray-centred coordinates is based on specific knowledge of the first-order transformation between Cartesian and ray-centred phase-space perturbations. Such transformation can also be used for defining initial conditions for dynamic ray tracing in Cartesian coordinates and for obtaining the coefficients involved in two-point traveltime extrapolation. As a step towards extending dynamic ray tracing in ray-centred coordinates to higher orders we establish detailed information about the higher-order properties of the transformation between the Cartesian and ray-centred phase-space perturbations. By numerical examples, we (1) visualize the validity limits of the ray-centred coordinate system, (2) demonstrate the transformation of higher-order derivatives of traveltime from Cartesian to ray-centred coordinates and (3) address the stability of function value and derivatives of volumetric parameters in a higher-order representation of the subsurface model.more » « less
-
QR factorization is a key tool in mathematics, computer science, operations research, and engineering. This paper presents the roundoff-error-free (REF) QR factorization framework comprising integer-preserving versions of the standard and the thin QR factorizations and associated algorithms to compute them. Specifically, the standard REF QR factorization factors a given matrix $$A \in \Z^{m \times n}$$ as $A=QDR$, where $$Q \in \Z^{m \times m}$$ has pairwise orthogonal columns, $$D$$ is a diagonal matrix, and $$R \in \Z^{m \times n}$$ is an upper trapezoidal matrix; notably, the entries of $$Q$$ and $$R$$ are integral, while the entries of $$D$$ are reciprocals of integers. In the thin REF QR factorization, $$Q \in \Z^{m \times n}$$ also has pairwise orthogonal columns, and $$R \in \Z^{n \times n}$$ is also an upper triangular matrix. In contrast to traditional (i.e., floating-point) QR factorizations, every operation used to compute these factors is integral; thus, REF QR is guaranteed to be an exact orthogonal decomposition. Importantly, the bit-length of every entry in the REF QR factorizations (and within the algorithms to compute them) is bounded polynomially. Notable applications of our REF QR factorizations include finding exact least squares or exact basic solutions (i.e., a rational n-dimensional vector $$x$$) to any given full column rank or rank deficient linear system $A x = b$, respectively. In addition, our exact factorizations can be used as a subroutine within exact and/or high-precision quadratic programming. Altogether, REF QR provides a framework to obtain exact orthogonal factorizations of any rational matrix (as any rational/decimal matrix can be easily transformed into an integral matrix).more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.3390/atoms10010014
