Related papers: Free Convex Algebraic Geometry
In recent years, the intersection of algebra, geometry, and combinatorics with particle physics and cosmology has led to significant advances. Central to this progress is the twofold formulation of the study of particle interactions and…
Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…
We provide a construction of free factorization algebras in algebraic geometry and link factorization homology of a scheme with coefficients in a free factorization algebra to the homology of its (unordered) configuration spaces. As an…
We discuss interrelations between: Cohn localizations of full square matrices; a Leavitt localization of a row; and the Jacobson quasi-inverses of quasi-regular elements. The latter Jacobson localizations appear naturally and easily in…
This Thesis is devoted to the study of Metric-Affine Theories of Gravity and Applications to Cosmology. The thesis is organized as follows. In the first Chapter we define the various geometrical quantities that characterize a non-Riemannian…
Let X be a smooth projective surface defined over an uncountable algebraically closed field k and let k(X) be its field of rational functions. Let s be an automorphism of X. This paper proves there is a non-negative integer n and elements a…
Directed spaces are natural topological extensions of dcpos in domain theory and form a cartesian closed category. In order to model nondeterministic semantics, the power structures over directed spaces were defined through the form of free…
As science and engineering have become increasingly data-driven, the role of optimization has expanded to touch almost every stage of the data analysis pipeline, from signal and data acquisition to modeling and prediction. The optimization…
The clear understanding of the non-convex landscape of neural network is a complex incomplete problem. This paper studies the landscape of linear (residual) network, the simplified version of the nonlinear network. By treating the gradient…
We consider skew free extensions of rings, also known as free multivariate skew polynomial rings, and explore some of the algebraic aspects of this construction. We give different characterizations of such rings and present conditions for…
One of the main applications of free probability is to show that for appropriately chosen independent copies of $d$ random matrix models, any noncommutative polynomial in these $d$ variables has a spectral distribution that converges…
These notes give an informal and leisurely introduction to $\mathrm{G}_2$ geometry for beginners. A special emphasis is placed on understanding the special linear algebraic structure in $7$ dimensions that is the pointwise model for…
This article demonstrates how an understanding of the geometry of a family of cost functions can be used to develop efficient numerical algorithms for real-time optimisation. Crucially, it is not the geometry of the individual functions…
Axial algebras are a recently introduced class of non-associative algebra motivated by applications to groups and vertex-operator algebras. We develop the structure theory of axial algebras focussing on two major topics: (1) radical and…
This article studies generalizations of (matrix) convexity, including partial convexity and biconvexity, under the umbrella of $\Gamma$-convexity. Here $\Gamma$ is a tuple of free symmetric polynomials determining the geometry of a…
We consider several basic questions pertaining to the geometry of image of a general quadratic map. In general the image of a quadratic map is non-convex, although there are several known classes of quadratic maps when the image is convex.…
Volume parameterizations abound in recent literature, from the classic voxel grid to the implicit neural representation and everything in between. While implicit representations have shown impressive capacity and better memory efficiency…
A new convenient method of describing flat convex compact sets is proposed. It generalizes classical trigonometric functions $\sin$ and $\cos$. Apparently, this method may be very useful for explicit description of solutions of optimal…
A convex geometry is finite zero-closed closure system that satisfies the anti-exchange property. Complexity results are given for two open problems related to representations of convex geometries using implication bases. In particular, the…
Qualification conditions (also termed constraint qualifications) help avoid pathological behavior at domain boundaries in convex analysis. By generalizing facial reduction from conic programming to general convex programs of the form $f(x)…