archive
Every paper Pith has read. Search by title, abstract, or pith.
83 papers in cs.SC · page 2
-
Rational networks recover exact PDEs from noiseless data
Symbolic recovery of PDEs from measurement data
-
Separation method yields concise conditions for quartic positivity
A Separation Method for Quartic Positivity and the Valid Region of Gram-Charlier densities
-
Tensor structure lowers 6x6 matrix mult exponent to 2.8019
Exploiting the Structure in Tensor Decompositions for Matrix Multiplication
-
Valued fields admit non-polyhedral spectrahedra and strict SDR sets
On semidefinite-representable sets over valued fields
-
HDC model detects mountain sickness at 91% accuracy on wearables
AMS-HD: Hyperdimensional Computing for Real-Time and Energy-Efficient Acute Mountain Sickness Detection
-
Non-commutative trick yields holonomic submodules in partial Weyl closures
Computing a holonomic submodule of the partial Weyl closure
-
Exact volumes computed for convex bodies from concave polynomials
Exact Volumes of Semi-Algebraic Convex Bodies
-
MDDs speed up signature Gröbner bases via compact monomial diagrams
A data structure for monomial ideals with applications to signature Gr\"obner bases
-
Two new methods compile constraints for lifted planning without grounding
Two Constraint Compilation Methods for Lifted Planning
-
Graph method speeds symmetric tensor canonicalization
SeQuant Framework for Symbolic and Numerical Tensor Algebra. I. Core Capabilities
-
Terracini unions make algebraic matroids of joins equal their summands
Terracini matroids: algebraic matroids of secants and embedded joins
-
Decomposing statements nearly doubles premise retrieval in math formalization
DRIFT: Decompose, Retrieve, Illustrate, then Formalize Theorems
-
Probabilistic method isolates all local minimizers of Morse functions
Probabilistic algorithm for computing all local minimizers of Morse functions on a compact domain
-
Algorithm finds leading monomials for generic sequences without reductions
An Algorithm for Computing the Leading Monomials of a Minimal Groebner Basis of Generic Sequences
-
Majorization stops characterizing CH inequalities after degree 7
Majorization and Inequalities among Complete Homogeneous Symmetric Functions
-
Support bound computes minimal equations for dynamical systems
Projecting dynamical systems via a support bound
-
Symbolic algorithm solves multi-diagonal linear systems
Symbolic Algorithm for Solving SLAEs with Multi-Diagonal Coefficient Matrices
-
GPT-4o first to shift from knowledge gaps to generalization in visual math
We-Math: Does Your Large Multimodal Model Achieve Human-like Mathematical Reasoning?
-
Algorithms solve norm equation to factor differential operators in char p
Factoring Linear Differential Operators in Positive Characteristic by means of Solving a Norm Equation
-
Parallel two-stage method scales symbolic time series approximation
Parallel Two-Stage Approach for Joint Symbolic Approximation of Time Series
-
Eigenvalue orderings reduced to symmetric polynomial root counts
Conditions for eigenvalue configurations of two real symmetric matrices (symmetric polynomial approach)
-
CoALA organizes language agents with memory and actions
Cognitive Architectures for Language Agents
-
Evolutionary search recovers scientific equations from data
Interpretable Machine Learning for Science with PySR and SymbolicRegression.jl
-
Explicit algorithm computes square roots in quaternion algebras
Computing square roots in quaternion algebras
-
Maximal characteristic height of Hessenberg Bohemian matrices grows exponentially in order
Upper Hessenberg and Toeplitz Bohemians
-
LogAG captures default logic and circumscription via argument systems
A Unified Algebraic Framework for Non-Monotonicity
-
Coq definitions prove fairness properties of double-sided auctions
Formal verification of trading in financial markets
-
Symmetry in hypergeometric terms restricts reduced remainders to even or odd powers
Polynomial Reduction and Super Congruences
-
Substitution and augmentation fix nonlinear DAEs for structural solvers
Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
-
Transformation reduces sorting verification to integer constraints
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
-
Annotary analyzes inter-contract smart contract flows via annotations
Annotary: A Concolic Execution System for Developing Secure Smart Contracts
-
Finite p-adic precision solves zero-dimensional polynomial systems
Solving p-adic polynomial systems via iterative eigenvector algorithms
-
Loop transformations keep adjoint stencil code parallelizable
Automatic Differentiation for Adjoint Stencil Loops
-
phcpy adds JupyterHub and GPU support for polynomial solvers
Solving Polynomial Systems with phcpy
-
Mappings translate 2405 DLMF expressions to Maple
Semantic Preserving Bijective Mappings for Expressions involving Special Functions in Computer Algebra Systems and Document Preparation Systems