Search results for "symbolic computation"

showing 10 items of 124 documents

A novel approach to integration by parts reduction

2015

Integration by parts reduction is a standard component of most modern multi-loop calculations in quantum field theory. We present a novel strategy constructed to overcome the limitations of currently available reduction programs based on Laporta's algorithm. The key idea is to construct algebraic identities from numerical samples obtained from reductions over finite fields. We expect the method to be highly amenable to parallelization, show a low memory footprint during the reduction step, and allow for significantly better run-times.

FOS: Computer and information sciencesComputer Science - Symbolic ComputationHigh Energy Physics - TheoryPhysicsNuclear and High Energy Physics010308 nuclear & particles physicsFOS: Physical sciencesConstruct (python library)Symbolic Computation (cs.SC)01 natural scienceslcsh:QC1-999Computational scienceReduction (complexity)High Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)Finite fieldHigh Energy Physics - Theory (hep-th)Component (UML)0103 physical sciencesKey (cryptography)Memory footprintIntegration by partsAlgebraic number010306 general physicslcsh:PhysicsPhysics Letters B
researchProduct

Symbolic integration of hyperexponential 1-forms

2019

Let $H$ be a hyperexponential function in $n$ variables $x=(x_1,\dots,x_n)$ with coefficients in a field $\mathbb{K}$, $[\mathbb{K}:\mathbb{Q}] <\infty$, and $\omega$ a rational differential $1$-form. Assume that $H\omega$ is closed and $H$ transcendental. We prove using Schanuel conjecture that there exist a univariate function $f$ and multivariate rational functions $F,R$ such that $\int H\omega= f(F(x))+H(x)R(x)$. We present an algorithm to compute this decomposition. This allows us to present an algorithm to construct a basis of the cohomology of differential $1$-forms with coefficients in $H\mathbb{K}[x,1/(SD)]$ for a given $H$, $D$ being the denominator of $dH/H$ and $S\in\mathbb{K}[x…

FOS: Computer and information sciencesMathematics - Differential GeometryComputer Science - Symbolic ComputationPure mathematicsMathematics::Commutative Algebra010102 general mathematics68W30Field (mathematics)010103 numerical & computational mathematicsFunction (mathematics)[MATH] Mathematics [math]Symbolic Computation (cs.SC)16. Peace & justiceFunctional decomposition01 natural sciencesDifferential Geometry (math.DG)FOS: MathematicsComputer Science::Symbolic Computation0101 mathematics[MATH]Mathematics [math]Symbolic integrationMathematics
researchProduct

Constructing Antidictionaries in Output-Sensitive Space

2021

A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$. Given a collection of $k$ words $y_1,y_2,\ldots,y_k$ over an alphabet $\Sigma$, we are asked to compute the set $\mathrm{M}^{\ell}_{y_{1}\#\ldots\#y_{k}}$ of minimal absent words of length at most $\ell$ of word $y=y_1\#y_2\#\ldots\#y_k$, $\#\notin\Sigma$. In data compression, this corresponds to computing the antidictionary of $k$ documents. In bioinformatics, it corresponds to computing words that are absent from a genome of $k$ chromosomes. This computation generally requires $\Omega(n)$ space for $n=|y|$ using any of the plenty available $\mathcal{O}(n)$-time algorithms. This is because a…

FOS: Computer and information sciencesSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniOutput sensitive algorithmsString algorithmsPhysicsAntidictionarieSettore INF/01 - InformaticaOutput sensitive algorithm0102 computer and information sciencesAbsent wordsSpace (mathematics)01 natural sciencesAntidictionariesCombinatorics010201 computation theory & mathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYData compressionComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)Computer Science::Symbolic Computation[INFO]Computer Science [cs]Absent wordAlphabetWord (group theory)2019 Data Compression Conference (DCC)
researchProduct

Determinantal sets, singularities and application to optimal control in medical imagery

2016

International audience; Control theory has recently been involved in the field of nuclear magnetic resonance imagery. The goal is to control the magnetic field optimally in order to improve the contrast between two biological matters on the pictures. Geometric optimal control leads us here to analyze mero-morphic vector fields depending upon physical parameters , and having their singularities defined by a deter-minantal variety. The involved matrix has polynomial entries with respect to both the state variables and the parameters. Taking into account the physical constraints of the problem, one needs to classify, with respect to the parameters, the number of real singularities lying in som…

FOS: Computer and information sciences[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]Computer Science - Symbolic Computation0209 industrial biotechnologyPolynomialRank (linear algebra)010102 general mathematicsBoundary (topology)Field (mathematics)02 engineering and technologySymbolic Computation (cs.SC)Optimal control01 natural sciencesPolynomial system solvingReal geometryPolynomial matrix[ INFO.INFO-SC ] Computer Science [cs]/Symbolic Computation [cs.SC]Set (abstract data type)Matrix (mathematics)020901 industrial engineering & automationApplications0101 mathematicsAlgorithmMathematics
researchProduct

The infinite dihedral group

2022

We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.

FOS: Mathematics20F65 (Primary) 05C25 20E08 68Q70 13F25 (Secondary)Computer Science::Symbolic ComputationGroup Theory (math.GR)Nonlinear Sciences::Cellular Automata and Lattice GasesMathematics - Group TheoryComputer Science::Formal Languages and Automata Theory
researchProduct

Teaching and Learning of Algebra

2015

Topic Study Group 9 aimed to bring together researchers, developers and teachers who investigate and develop theoretical accounts of the teaching and learning of algebra. The group sought both empirically grounded contributions focussing on the learning and teaching of algebra in diverse classrooms settings, the evolution of algebraic reasoning from elementary through university schooling as well as theoretical contributions throwing light on the complexities involved in teaching and learning of algebra. Prospective contributors were requested to address one or more of the following themes: early algebra, use of ICT in algebra classrooms, proof and proving in algebra, problem solving, semio…

Group (mathematics)Computer sciencePhysics::Physics EducationSymbolic computationComputer Science::Computers and SocietyAlgebraic reasoningAlgebraInformation and Communications TechnologyComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONComputingMilieux_COMPUTERSANDEDUCATIONSemioticsAlgebra over a fieldCurriculumEarly Algebra
researchProduct

Factorization of denominators in integration-by-parts reductions

2020

We present a Mathematica package which finds a basis of master integrals for the Feynman integral reduction. In this basis the dependence on the dimensional regularization in the denominators factorizes in kinematic independent polynomials.

High Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)Computer Science::Mathematical SoftwareFOS: Physical sciencesComputer Science::Symbolic Computation
researchProduct

Integral Reduction with Kira 2.0 and Finite Field Methods

2021

We present the new version 2.0 of the Feynman integral reduction program Kira and describe the new features. The primary new feature is the reconstruction of the final coefficients in integration-by-parts reductions by means of finite field methods with the help of FireFly. This procedure can be parallelized on computer clusters with MPI. Furthermore, the support for user-provided systems of equations has been significantly improved. This mode provides the flexibility to integrate Kira into projects that employ specialized reduction formulas, direct reduction of amplitudes, or to problems involving linear system of equations not limited to relations among standard Feynman integrals. We show…

High Energy Physics - TheoryComputer scienceLinear systemGeneral Physics and AstronomyFOS: Physical sciencesRational functionSystem of linear equationsSymbolic computation01 natural sciences010305 fluids & plasmasAlgebraHigh Energy Physics - PhenomenologyFinite fieldHigh Energy Physics - Phenomenology (hep-ph)High Energy Physics - Theory (hep-th)Hardware and Architecture0103 physical sciencesIntegration by partsLinear independenceIntegration by reduction formulae010306 general physics
researchProduct

"Table 8" of "A new measurement of the Collins and Sivers asymmetries on a transversely polarised deuteron target"

2006

Collins asymmetry against Bjorken X for all positive hadrons.

InclusiveAsymmetry MeasurementMU+ DEUT --&gt; MU+ HADRON+ XHigh Energy Physics::PhenomenologyNeutral CurrentDeep Inelastic ScatteringPhysics::Accelerator PhysicsComputer Science::Symbolic ComputationHigh Energy Physics::ExperimentNuclear ExperimentMuon productionASYM
researchProduct

"Table 11" of "A new measurement of the Collins and Sivers asymmetries on a transversely polarised deuteron target"

2006

Collins asymmetry against Bjorken X for leading positive hadrons.

InclusiveAsymmetry MeasurementMU+ DEUT --&gt; MU+ HADRON+ XHigh Energy Physics::PhenomenologyNeutral CurrentDeep Inelastic ScatteringPhysics::Accelerator PhysicsComputer Science::Symbolic ComputationHigh Energy Physics::ExperimentNuclear ExperimentMuon productionASYM
researchProduct