Efficient algorithms decide algebraic constraints of causal graphs.
problem Distinguish causal graphs with latent confounders.
method Study algebraic constraints and propose efficient algorithms.
result Decide equivalence or subset of algebraic constraints.
Paper constructs observables using multisymplectic geometry and algebraic methods.
problem Building observables in multisymplectic geometry.
method Uses L∞-algebras, Gerstenhaber algebras, BV-modules, and constraint triples. result Reconstructs and explains recent geometric results.
A new algebra for Frobenius manifolds solves PDEs and constraints.
problem Understanding the algebraic structure of Frobenius manifolds.
method Constructing a Virasoro-like algebra and deriving PDEs and constraints.
result Solves a family of quadratic PDEs for the genus-zero free energy.
Despite their popularity, many questions about the algebraic constraints imposed by linear structural equation models remain open problems. For causal discovery, two of these problems are especially important: the enumeration of the constraints imposed by a model, and deciding whether two graphs define the same statist…
Theory for gravity coupled with fields on manifolds with null-boundary.
problem Formulating a theory for gravity coupled with scalar, SU(n), and spinor fields on manifolds with null-boundary.
method Symplectic reduction of boundary fields and constraints analysis.
result The set of constraints does not form a first class system for the three couplings.
Paper uses algebraic signatures to identify probabilistic structures in empirical data.
problem Identifying probabilistic structure from observed binomials in empirical probability tensors.
method Treating vanishing binomials as algebraic signatures, matching signatures to identify models without parameter estimation.
result The method successfully identified rank-one structures in real language data, revealing interpretable sets of words.
The ``classical BRST construction'' as developed by Batalin-Fradkin-Vilkovisky is a homological construction for the reduction of the Poisson algebra P=C∞(W) of smooth functions on a Poisson manifold W by the ideal I of functions which vanish on a constraint locus. This ideal is called first class if I…
Study algebraic invariants from lightning self-attention models.
problem Understanding polynomial coefficients of self-attention mechanisms.
method Identify algebraic invariants using polynomial coefficients and coordinate geometry.
result Found linear and nonlinear families of algebraic invariants.
We study algebraic varieties of ReLU networks to understand their representable functions.
problem Understanding the functions that ReLU neural networks can represent.
method We introduce algebraic varieties associated with ReLU networks and derive polynomial equations to characterize representable functions.
result Conditions under which ReLU networks attain their expected dimension, providing insight into their structural properties.
Constructs Lie-Rinehart algebra for Einstein's equations.
problem Initial value problem constraints for Einstein's equations.
method BV-BFV approach to boundary value problems, constructing L∞-algebroid. result Lie-Rinehart algebra comes from slight generalization of Lie algebroid.
Graphical notation simplifies complex polynomial constraints in linear models.
problem Complex polynomial constraints in linear structural equation models are impractical.
method Developed a graphical notation to represent these constraints.
result The graphical notation simplifies the representation of many polynomial constraints.
New techniques solve Riccati equations on 3D manifolds, finding 4th order metric obstructions.
problem Solving Riccati-type equations with algebraic constraints on 3D Riemannian manifolds.
method Real algebraic geometry techniques, focusing on connection coefficients and Hessian equations.
result Obstruction to solving Riccati equations has order 4 in metric coefficients.
If a knot K bounds a genus one Seifert surface F in the 3-sphere and F contains an essential simple closed curve alpha that has induced framing 0 and is smoothly slice, then K is smoothly slice. Conjecturally, the converse holds. It is known that if K is slice, then there are strong constraints on the algebraic concord…
Clean intersections of Lagrangian knots in 3D are impossible.
problem Prohibiting clean intersections of certain knots in 3D symplectic geometry.
method Symplectic field theory and algebraic constraints on augmentation varieties.
result No Hamiltonian diffeomorphism can cleanly intersect a specific type of knot's conormal bundle.
The article examines twisted cohomologies on algebraic and analytic varieties.
problem Understanding and comparing twisted cohomologies on algebraic and analytic varieties.
method Comparison and definition of twisting parameters in both categories, algebraic and analytic.
result Reviewed isomorphisms of twisted cohomologies for cohomologous twisting parameters.
2-compatible Lie algebras are quadratic deformations of Lie algebras with specific constraints.
problem Classifying contact Lie algebras using quadratic deformations.
method Defining 2-compatible Lie algebras as quadratic deformations of Lie algebras and studying the constraints on these deformations.
result Any (2p+1)-dimensional contact Lie algebra is isomorphic to a quadratic deformation of the Heisenberg algebra.
Study star products on Poisson manifolds compatible with reduction.
problem Finding star products compatible with coisotropic reduction.
method Compute second constraint Hochschild cohomology of constraint algebra.
result Determine infinitesimal star products on Poisson manifolds.
Establishes a connection between Kähler metrics and vector bundle sections.
problem Finding Kähler metrics in a conformal class.
method One-to-one correspondence between Kähler metrics and parallel sections of a vector bundle with conformally invariant connection.
result Obstructions for a Riemannian metric to be conformal to a Kähler metric.
Constructs real algebraic maps with specific geometric constraints.
problem Construct smooth functions with prescribed Reeb graphs.
method Explicitly constructs real algebraic maps whose images are domains surrounded by products of hyperbolas and affine spaces.
result New examples of real algebraic maps with specified geometric constraints.
We develop the necessary theory in computational algebraic geometry to place Bayesian networks into the realm of algebraic statistics. We present an algebra{statistics dictionary focused on statistical modeling. In particular, we link the notion of effiective dimension of a Bayesian network with the notion of algebraic…
Symmetric spaces' connections form Lie admissible triple algebras.
problem Understanding the algebraic structure of symmetric spaces' connections.
method Analyzing the connection as a binary operator on tangent bundle sections, identifying Lie admissibility constraints.
result Connection algebra of symmetric spaces is a Lie admissible triple algebra.
Estimation in generalized linear models (GLM) is complicated by the presence of constraints. One can handle constraints by maximizing a penalized log-likelihood. Penalties such as the lasso are effective in high dimensions, but often lead to unwanted shrinkage. This paper explores instead penalizing the squared distanc…
We study `constrained generalized Killing (s)pinors', which characterize supersymmetric flux compactifications of supergravity theories. Using geometric algebra techniques, we give conceptually clear and computationally effective methods for translating supersymmetry conditions into differential and algebraic constrain…
Solved a conjecture about rational homology projective planes with quotient singularities.
problem A conjecture about rational homology projective planes with quotient singularities.
method Combining Donaldson's diagonalization theorem with a distinguished spin^c structure on the smooth locus.
result Proved that rational homology projective planes with quotient singularities have at most three singular points.
We propose using category theory to unify deep learning architectures.
problem Lack of a coherent bridge between model constraints and implementations.
method Apply category theory to unify neural network design.
result Theory recovers constraints from geometric deep learning and encodes standard constructs.
Geodesic extensions for systems with nonholonomic constraints.
problem Extending equations of motion for systems with nonholonomic constraints.
method Constructing extensions to second-order ODEs, investigating geodesic conditions.
result Conditions for nonholonomic trajectories to be geodesics of a Riemannian metric.
Unified framework for integrating linear constraints in time series forecasting.
problem Challenges in traditional time series forecasting algorithms.
method Unified framework combining linear constraints in time series forecasting.
result Exact minimizer of the constrained empirical risk can be computed efficiently using linear algebra.
Bayesian network models with latent variables are widely used in statistics and machine learning. In this paper we provide a complete algebraic characterization of Bayesian network models with latent variables when the observed variables are discrete and no assumption is made about the state-space of the latent variabl…
Study on Yang-Mills fields on S4 proving self-duality constraints.
problem Proving self-duality of weakly stable Yang-Mills fields on S4. method Investigating irreducible connections under self-duality assumption.
result Irreducible Yang-Mills fields on S4 are either self-dual or anti-self-dual. In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of arbitrary rank to be identifiable from a set of matrix entries, yielding theoretical…
Solves second-order PDEs using quotients and differential invariants.
problem Solving second-order PDEs with first-order quotients.
method Solve the quotient PDE using differential invariants, then add new constraints to solve the original PDE.
result New method for solving second-order scalar PDEs with infinite-dimensional symmetry algebras.
The paper tackles MAP inference over non-convex constraints in safety-critical settings.
problem Efficiently computing MAP predictions subject to non-convex constraints is challenging.
method The paper investigates conditions for exact and efficient MAP inference over continuous variables and devises scalable algorithms for both tractable and general cases.
result The proposed methods outperform constraint-agnostic baselines and scale to complex densities.
PDEs constrain smooth functions in neural networks.
problem Understanding functions computable by neural networks.
method Analyzing smooth hierarchical functions via PDEs.
result Established algebraic PDEs for smooth functions.
We propose a model in which a spliced vector bundle (with an arbitrary number of gauge structures in the splice) possesses a geometry which do not split. The model employs connection 1-forms with values in a space-product of Lie algebras, and therefore interlaces the various gauge structures in a non-trivial manner. Sp…
On a (pseudo-)Riemannian manifold (MM,g), some fields of endomorphisms i.e. sections of End(TMM) may be parallel for g. They form an associative algebra A, which is also the commutant of the holonomy group of g. As any associative algebra, A is the sum of its radical and of a semi-simple algebra S. Here we study S: it …
The paper decomposes spacelike hypersurface properties for general relativistic vacuum equations.
problem Analyzing properties of spacelike hypersurfaces in general relativity.
method Used L2-orthogonal decomposition and Ahlfors Laplacian. result Decomposed the second fundamental form of spacelike hypersurfaces.
Unified analysis of multilabel Fisher discriminants with improved dimensionality and robustness.
problem Improving discriminant analysis for multilabel classification with enhanced dimensionality and robustness.
method Unified theoretical analysis of multilabel Fisher discriminants with algebraic and statistical guarantees.
result Unified characterization of multilabel Fisher objectives and their equivalence under orthogonality constraints.
New approach approximates c-space geometry of multi-loop linkages.
problem Higher-order mobility analysis of multi-loop linkages.
method Higher-order Taylor series expansion of geometric constraint mapping using joint screws.
result Local approximation of c-space and configurations with certain rank.
We propose an explicit construction of the deformation quantization of the general second-class constrained system, which is covariant with respect to local coordinates on the phase space. The approach is based on constructing the effective first-class constraint (gauge) system equivalent to the original second-class o…
We introduce a tensor-based clustering method to extract sparse, low-dimensional structure from high-dimensional, multi-indexed datasets. This framework is designed to enable detection of clusters of data in the presence of structural requirements which we encode as algebraic constraints in a linear program. Our cluste…
New method for flux quantization on phase space stacks.
problem Defining and constructing flux-quantized phase space stacks.
method Observation of flux densities and characterization of Cauchy data.
result Flux-quantized phase space stacks have classifying spaces with rational Whitehead L-infinity algebra.
Eguchi-Hori-Xiong and S. Katz proposed a conjecture that the partition function of topological sigma model coupled to gravity is annihilated by infinitely many differential operators which form half branch of the Virasoro algebra. In this paper, we give a proof to this conjecture for the genus 0 part.
We prove that the extended Toda hierarchy of \cite{CDZ} admits nonabelian Lie algebra of infinitesimal symmetries isomorphic to the half of the Virasoro algebra. The generators Lm, m≥−1 of the Lie algebra act by linear differential operators onto the tau function of the hierarchy. We also prove that the tau fu…
New methods improve accuracy in detecting concentric objects.
problem Detecting concentric geometric objects in noisy data.
method Developed new estimators and compared performance of existing methods.
result New methods outperform existing non-iterative methods and are robust to noise.
We study constrained generalized Killing spinors over the metric cone and cylinder of a (pseudo-)Riemannian manifold, developing a toolkit which can be used to investigate certain problems arising in supersymmetric flux compactifications of supergravity theories. Using geometric algebra techniques, we give conceptually…
Under the assumption of asymptotic relative Chow-stability for polarized algebraic manifolds (M,L), a series of weighted balanced metrics ωm, m≫1, called polybalanced metrics, are obtained from complete linear systems ∣Lm∣ on M. Then the asymptotic behavior of the weights as m→∞ will be stud…
Paper studies sparsity and DAG constraints for learning linear DAGs.
problem Learning DAGs from data is challenging due to the large search space.
method Formulates structure learning as a constrained optimization problem with soft sparsity and DAG constraints.
result Soft sparsity and DAG constraints lead to an easier optimization problem.
Study on harmonic spinors on specific Lie groups.
problem Existence of left-invariant harmonic spinors on 3D Lie groups.
method Revised spin Dirac operator formula for left-invariant spinors, identified constraints on Lie algebras, and classified metrics with harmonic spinors.
result Identified conditions and metrics for left-invariant harmonic spinors on 3D Lie groups.