A study of proper affine vector fields in plane symmetric static space-times by using the rank of the Rieman matrix and holonomy. Studying proper affine vector fields in each case, It is shown that the special class of the above space-times admit proper affine vector fields.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “Symmetric matrix fields”
We present a formula for the trace of any symmetric power of a matrix (with coefficients in a field) in terms of the ordinary powers of the matrix, an arbitrarily chosen linear function which vanishes on the identity matrix, and polynomial functions defined recursively.
The reduction problem of the chiral field equation on symmetric spaces is studied. It is shown that the symmetric chiral field has infinitely many local conservation laws. A recursive formula for these conservation laws is derived and the first associated integral of motion are given explicitly. Furthermore, the Zakhar…
Olshausen and Field (OF) proposed that neural computations in the primary visual cortex (V1) can be partially modeled by sparse dictionary learning. By minimizing the regularized representation error they derived an online algorithm, which learns Gabor-filter receptive fields from a natural image ensemble in agreement …
This paper derives radial fields on manifolds of symmetric positive definite matrices.
problem Lack of an expression for radial fields on manifolds of symmetric positive definite matrices.
method Derives an expression for radial fields on manifolds of symmetric positive definite matrices.
result Derives an expression for radial fields on manifolds of symmetric positive definite matrices.
Paper proves optimal decomposition for matrix fields, reducing convex integration steps.
problem Optimizing decomposition of symmetric matrix fields for convex integration.
method Algebraic geometry and topology applications to prove optimality.
result Optimal decomposition with fewer rank-one terms, improving Hölder regularity.
Weyl Tensors, Strongly Regular Graphs, Multiplicative Characters, and a Quadratic Matrix Equationmath.GR
Solutions to a quadratic matrix equation are linked to strongly regular graphs and multiplicative characters.
problem Solving a specific quadratic matrix equation in Riemannian geometry.
method Constructing nonzero solutions using group rings and multiplicative characters of finite fields.
result Solutions relate to strongly regular graphs and multiplicative characters of finite fields.
This work accelerates constrained sampling using large deviation principles.
problem Sampling constrained probability distributions efficiently.
method Large deviation principles applied to skew-reflected non-reversible Langevin dynamics.
result The skew-symmetric matrix accelerates convergence and reduces asymptotic variance.
Unimodular classification of symmetric matrix map-germs.
problem Classifying symmetric matrix map-germs under volume-preserving equivalence.
method Introducing symmetrical quasi-homogeneity and volume-preserving equivalence.
result All simple -equivalence classes coincide with volume-preserving equivalence classes.
Dynamics of four-dimensional massless fields of all spins is formulated in the Siegel space of complex symmetric matrices. It is shown that the unfolded equations of free massless fields, that have a form of multidimensional Schrodinger equations, naturally distinguish between positive- and negative-frequen…
Study differential properties of matrix square roots in specific cases.
problem Understanding matrix square roots in semi-simple, symmetric, and orthogonal cases.
method Analysis of differential and metric structures of real square roots of matrices under specific conditions.
result Differential properties of matrix square roots in semi-simple, symmetric, and orthogonal cases.
New algorithm for online optimization over symmetric cones, unifying previous methods.
problem Online convex optimization over symmetric cones.
method Symmetric-Cone Multiplicative Weights Update (SCMWU) algorithm.
result SCMWU is a no-regret algorithm.
In this paper, we define a semi-symmetric metric Killing vector field, then study semi-symmetric metric Killing vector fields on warped and multiply warped products with a semi-symmetric metric connection. We also study Killing and 2-Killing vector fields on multiply warped products.
Minimal submanifolds in matrix spaces proven for specific ranks.
problem Minimal submanifolds in matrix spaces.
method Proving semialgebraic sets of matrices are minimal.
result Rectangular, skew-symmetric, and symmetric matrices with prescribed eigenvalues are minimal.
We obtain a family of matrix integrals which decompose to a product of Gamma-functions (they have some relations with S.G.Gindikin 'Beta', but generally speaking essentially differ from it). We obtain Plancherel formula for Berezin representations for all series of classical groups (for large values of parameters of re…
Adaptive algorithm improves convergence rate of Langevin dynamics.
problem Improving convergence rate of Langevin dynamics.
method Adaptive non-reversible stochastic gradient Langevin dynamics algorithm.
result Improved convergence rate of the algorithm.
Given a symmetric nonnegative matrix , symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix , usually with much fewer columns than , such that . SymNMF can be used for data analysis and in particular for various clustering tasks. In this paper, we p…
Characterizes Lorentzian manifolds with semi-symmetric metric connections.
problem Characterizing Lorentzian manifolds with specific metric connections.
method Analyzing semi-symmetric metric connections with vanishing curvature and recurrent torsion.
result Establishes conditions for perfect fluid and generalized Robertson-Walker spacetimes.
Algorithm finds isotropy subgroups of orthogonal similarity on symmetric matrices.
problem Computing isotropy subgroups of orthogonal similarity on symmetric matrices.
method Algorithmic procedure solving a Toeplitz matrix equation.
result Structure of isotropy subgroups described.
The paper classifies Killing tensor fields on Riemannian symmetric spaces.
problem Understanding Killing tensor fields on Riemannian symmetric spaces.
method Reduced study to compact irreducible spaces, introduced top slot Killing tensor fields, and classified quadratic fields.
result Quadratic Killing tensor fields on Riemannian symmetric spaces of rank one are spanned by top-slot and decomposable fields.
Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descentmath.OC
Gradient descent achieves exact linear convergence rate for symmetric matrix completion.
problem Low-rank symmetric matrix completion using gradient descent.
method Local analysis of gradient descent for symmetric matrices without additional assumptions.
result Closed-form expression of exact linear convergence rate matches practice.
New method for symmetric matrix completion using ReLU sampling.
problem Symmetric positive semi-definite low-rank matrix completion with deterministic entry-dependent sampling.
method ReLU sampling, gradient descent with tailored initialization.
result Gradient descent with tailored initialization achieves global minima.
Quadratic Killing tensors on symmetric spaces which are not generated by Killing vector fieldsmath.DG
Researchers found non-Killing tensor fields on certain symmetric spaces.
problem Understanding Killing tensors on all Riemannian symmetric spaces.
method Constructed explicit examples of quadratic Killing tensors on quaternionic and Cayley projective spaces.
result Quadratic Killing tensors can be non-Killing on some symmetric spaces.
New method for mixed memberships using symmetrized Laplacian inverse matrix.
problem Mixed memberships in community detection.
method Spectral clustering on symmetrized Laplacian inverse matrix.
result Mixed-SLIM methods outperform state-of-the-art methods.
Go With the Flow, on Jupiter and Snow. Coherence From Model-Free Video Data without Trajectoriesphysics.data-an
Viewing a data set such as the clouds of Jupiter, coherence is readily apparent to human observers, especially the Great Red Spot, but also other great storms and persistent structures. There are now many different definitions and perspectives mathematically describing coherent structures, but we will take an image pro…
Develops symmetric Cartan calculus linking to Patterson-Walker metric.
problem No specific problem stated; focuses on developing a new calculus.
method Symmetric Cartan calculus, using torsion-free affine connections.
result Symmetric Cartan calculus is a complete analogue of classical Cartan calculus.
A vector field on a Riemannian manifold is called conformal Killing if it generates one-parameter group of conformal transformations. The class of conformal Killing symmetric tensor fields of an arbitrary rank is a natural generalization of the class of conformal Killing vector fields, and appears in different geometri…
Characterizes invariant contact metric structures on tangent sphere bundles of compact symmetric spaces.
problem Identifying invariant contact metric structures on tangent sphere bundles of compact symmetric spaces.
method Characterization through invariant Riemannian metrics and Killing vector fields.
result A family of invariant contact metric structures is obtained on tangent sphere bundles of compact symmetric spaces with rank greater than or equal to two.
NGD improves multivariate Gaussian inference by optimizing Fisher information.
problem Efficiently optimizing multivariate Gaussian models.
method Natural Gradient Descent applied to multivariate Gaussian parameters.
result NGD updates are more efficient for symmetric covariance matrices.
We show how geodesics, Jacobi vector fields and flag curvature of a Finsler metric behave under Zermelo deformation with respect to a Killing vector field. We also show that Zermelo deformation with respect to a Killing vector field of a locally symmetric Finsler metric is also locally symmetric.
The paper is on the vanishing topology of singular Milnor fibres of holomorphic families of arbitrary square, symmetric and skew-symmetric matrices with sufficiently many parameters. We define vanishing cycles on such fibres, prove an extended form of the Damon-Pike conjecture about the families of a special type…
A necessary condition for a connection in a vector bundle to be locally metric is for its curvature matrix, which consists of forms, to be skew symmetric with respect to some local frame. In this paper we give a simple algorithm that can be used to decide when a matrix of forms is equivalent to a skew symmetric…
The paper connects Riemannian Gaussian distributions to random matrix theory and diffusion kernels.
problem Analyzing Riemannian Gaussian distributions on symmetric spaces.
method Analytical computation of marginals using orthogonal and skew orthogonal polynomials, and diffusion kernels.
result Riemannian Gaussian distributions are random matrix types, and their probability density functions can be computed analytically.
New differential geometry perspective on orthogonal RNNs.
problem Mitigating exploding and vanishing gradients in RNNs.
method Using tools from differential geometry, parameterizing vector fields via directional derivatives of scalar functions.
result Our approach achieves comparable or better results on benchmark tasks.
Decomposition of symmetric tensor fields in the presence of a flat contact projective structuremath.DG
Let be an odd-dimensional Euclidean space endowed with a contact 1-form . We investigate the space of symmetric contravariant tensor fields on as a module over the Lie algebra of contact vector fields, i.e. over the Lie subalgebra made up by those vector fields that preserve the contact structure. If we cons…
The paper extends topological field theory to noncompact surfaces using symmetric powers.
problem Extending topological field theory to noncompact surfaces without closed boundaries.
method Constructing sectorial covers with combinatorics of the bar resolution.
result Recovering results of Rouquier and Manion on extending Heegaard-Floer theory.
Unique global solutions found for specific initial data.
problem Einstein-scalar-field equations with specific initial conditions.
method Spherically symmetric analysis of small, slowly decaying data.
result Unique global solutions exist for the equations.
A new method for efficiently computing derivatives of skew-symmetric matrix exponentials.
problem Efficient computation of derivatives for skew-symmetric matrices.
method Characterization of invertibility, construction of nearby logarithm, and efficient implementation.
result Explicit formulae for differentiation and its inverse of skew-symmetric matrix exponentials.
Determinants of theta curves and symmetric graphs are studied.
problem Understanding the determinants of theta curves and symmetric graphs.
method Combinatorial approach using Kirchhoff's Matrix Tree Theorem and spanning tree enumeration.
result The determinant of a simple theta curve is the product of the determinants of its constituent knots.
Study shows lightlike hypersurfaces in indefinite Sasakian manifolds are not symmetric.
problem Characterizing curvature symmetries in lightlike hypersurfaces of indefinite Sasakian manifolds.
method Analyzing properties of lightlike hypersurfaces in indefinite Sasakian manifolds.
result Lightlike hypersurfaces are not locally symmetric, semi-symmetric, or semi-parallel.
Extends knot invariant computation to symmetrically colored sl_N.
problem Computing quantum knot invariants for .
method Develops symmetrically colored R matrix for .
result Defines for positive braid knots.
Improved method for computing Fréchet means on SPD matrices.
problem Computing Fréchet means on the manifold of SPD matrices.
method Random matrix theory-based approach for estimating Fréchet means.
result Significantly outperforms state-of-the-art methods in experiments.
Derives a Hamiltonian model for 3D axially symmetric magnetohydrodynamics.
problem Modeling of 3D axially symmetric magnetohydrodynamics.
method Hamiltonian formulation and matrix discretization.
result First discrete model for 3D magnetohydrodynamics compatible with underlying Lie-Poisson structure.
The article recovers tensor fields from partial data using weighted divergent ray transforms.
problem Recovering tensor fields from partial data.
method Weighted divergent ray transforms, unique continuation property of fractional Laplacian, explicit reconstruction formulas.
result Recovery of symmetric -tensor fields and unique continuation for vector fields and symmetric 2-tensor fields.
Solving symmetric positive definite linear problems is a fundamental computational task in machine learning. The exact solution, famously, is cubicly expensive in the size of the matrix. To alleviate this problem, several linear-time approximations, such as spectral and inducing-point methods, have been suggested and a…
A new method computes link invariants from diagrams.
problem Computing link invariants efficiently.
method Single symmetric matrix from a link diagram.
result Multivariable Alexander polynomial computation.
Unique solutions found for wave-like decaying null infinity equations.
problem Wave-like decaying null infinity equations with spherically symmetric Einstein-scalar-field.
method Local and global unique solutions for small initial data.
result Sharp decaying condition for unique solutions.
Symmetric nonnegative matrix factorization (NMF), a special but important class of the general NMF, is demonstrated to be useful for data analysis and in particular for various clustering tasks. Unfortunately, designing fast algorithms for Symmetric NMF is not as easy as for the nonsymmetric counterpart, the latter adm…