Search results for " Symbolic"

showing 10 items of 87 documents

MultivariateApart: Generalized partial fractions

2021

We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied to terms of a sum separately. The package is designed to work in Mathematica, but also provides interfaces to the Form and Singular computer algebra systems.

Computer Science - Symbolic ComputationHigh Energy Physics - TheoryFOS: Computer and information sciencesPolynomialComputer scienceFOS: Physical sciencesGeneral Physics and AstronomyRational functionSymbolic Computation (cs.SC)Partial fraction decomposition01 natural sciencesGröbner basisHigh Energy Physics - Phenomenology (hep-ph)ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION0103 physical sciences010306 general physicsSpurious relationshipcomputer.programming_language010308 nuclear & particles physicsFunction (mathematics)Symbolic computationAlgebraHigh Energy Physics - PhenomenologyHigh Energy Physics - Theory (hep-th)Hardware and ArchitectureComputer Science::Mathematical SoftwareWolfram LanguagecomputerComputer Physics Communications
researchProduct

Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language

2002

AbstractThe traditional split into a low level language and a high level language in the design of computer algebra systems may become obsolete with the advent of more versatile computer languages. We describe GiNaC, a special-purpose system that deliberately denies the need for such a distinction. It is entirely written in C++and the user can interact with it directly in that language. It was designed to provide efficient handling of multivariate polynomials, algebras and special functions that are needed for loop calculations in theoretical quantum field theory. It also bears some potential to become a more general purpose symbolic package.

Computer Science - Symbolic ComputationI.1.3FOS: Computer and information sciencesFor loopTheoretical computer scienceAlgebra and Number TheoryFOS: Physical sciencesI.1.1; I.1.3Symbolic Computation (cs.SC)Computational Physics (physics.comp-ph)Symbolic computationI.1.1High Energy Physics - PhenomenologyComputational MathematicsHigh Energy Physics - Phenomenology (hep-ph)General purposeHigh-level programming languageSpecial functionsFourth-generation programming languagePhysics - Computational PhysicsC programming languageLow-level programming languageMathematicsJournal of Symbolic Computation
researchProduct

Block 21 and the Pensabilità of the Representation of Auschwitz

2012

Abstract Building on the assumption that the Memorial in Honor of Italians Fallen in Nazi Extermination Camps (situated in Auschwitz I, Block 21) expresses the meta-reflexive inclination that strengthened the twentieth century (the capacity of that century to think of itself as a subject), this article aims to highlight and illustrate the dual philosophical significance of the Memorial. From the perspective of the philosophy of history, this philosophical significance, which has a symbolic value, leads us to investigate an organic and historically embodied conception of deportation. From the perspective of the aesthetics of memory, this philosophical meaning offers a new framework for the …

Cultural StudiesCognitive scienceHistoryRAPPRESENTAZIONEAUSCHWITZVisual Arts and Performing ArtsPhilosophy of historymedia_common.quotation_subjectReligious studiesSubject (philosophy)Representation (arts)ArtMeaning (philosophy of language)DeportationExpression (architecture)AestheticsHonorPensare dopo AuschwitzSettore M-FIL/01 - Filosofia TeoreticaThe SymbolicRappresentazione estetica memoria Auschwitzmedia_commonImages
researchProduct

The minimal free resolution of fat almost complete intersections in ℙ1 x ℙ1

2017

AbstractA current research theme is to compare symbolic powers of an ideal I with the regular powers of I. In this paper, we focus on the case where I = IX is an ideal deûning an almost complete intersection (ACI) set of points X in ℙ1 × ℙ1. In particular, we describe a minimal free bigraded resolution of a non-arithmetically Cohen-Macaulay (also non-homogeneous) set 𝒵 of fat points whose support is an ACI, generalizing an earlier result of Cooper et al. for homogeneous sets of triple points. We call 𝒵 a fat ACI.We also show that its symbolic and ordinary powers are equal, i.e, .

Current (mathematics)Ideal (set theory)General MathematicsPoints in ℙ1× ℙ1010102 general mathematicsComplete intersectionArithmetically Cohen-Macaulay; Points in ℙ1× ℙ1; Resolution; Symbolic powersSymbolic powers01 natural sciencesArithmetically Cohen-MacaulayCombinatoricsSet (abstract data type)Settore MAT/02 - AlgebraHomogeneous0103 physical sciencesArithmetically Cohen-Macaulay Points in ℙ1xℙ1 Resolution Symbolic powersSettore MAT/03 - Geometria010307 mathematical physics0101 mathematicsResolutionFocus (optics)Resolution (algebra)Mathematics
researchProduct

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

2007

The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…

Discrete mathematicsDegree (graph theory)ComputationDegenerate energy levelsACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION/I.1.2: Algorithms/I.1.2.0: Algebraic algorithms020207 software engineering010103 numerical & computational mathematics02 engineering and technology[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.3: EfficiencyCombinatoricsIntersection0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Adjacency listGravitational singularity0101 mathematicsAlgebraic numberACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysisMathematics
researchProduct

Rituales funerarios y de duelo colectivos y privados, religiosos o laicos

2014

My Docthoral Thesis carried out with religious subjects from different creeds and with non religious individuals found that participation in collective funerary rites and in private rituals –religious or secular - allow the mourners to say good bye and accept the death of their deceased loved ones (Paez et al., 2007)..Funerals and bereavement rituals allow the symbolic expression of feelings and thoughts, assist the mourners to cope with loss, and promote their recovery from bereavement (Pargament, 1997; Yoffe, 2012c.).

Expression (architecture)Feelingmedia_common.quotation_subjectGeneral Materials ScienceThe SymbolicSociologyReligious studiesmedia_commonAvances en Psicología
researchProduct

RationalizeRoots: Software Package for the Rationalization of Square Roots

2019

The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to find such transformations. After an introduction to the theoretical background, we explain in detail how to use the program in practice.

FOS: Computer and information sciencesComputer Science - Symbolic ComputationHigh Energy Physics - TheoryHigh energy particleFeynman integralComputationGeneral Physics and AstronomyFOS: Physical sciencesengineering.materialSymbolic Computation (cs.SC)Rationalization (economics)01 natural sciences010305 fluids & plasmasHigh Energy Physics - Phenomenology (hep-ph)Square root0103 physical sciencesComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONAlgebraic number010306 general physicsMathematical PhysicsVariable (mathematics)MapleMathematical Physics (math-ph)AlgebraHigh Energy Physics - PhenomenologyHigh Energy Physics - Theory (hep-th)Hardware and ArchitectureengineeringComputer Science - Mathematical SoftwareMathematical Software (cs.MS)
researchProduct

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

Conceptual Spaces for Cognitive Architectures: A lingua franca for different levels of representation

2017

During the last decades, many cognitive architectures (CAs) have been realized adopting different assumptions about the organization and the representation of their knowledge level. Some of them (e.g. SOAR [Laird (2012)]) adopt a classical symbolic approach, some (e.g. LEABRA [O'Reilly and Munakata (2000)]) are based on a purely connectionist model, while others (e.g. CLARION [Sun (2006)] adopt a hybrid approach combining connectionist and symbolic representational levels. Additionally, some attempts (e.g. biSOAR) trying to extend the representational capacities of CAs by integrating diagrammatical representations and reasoning are also available [Kurup and Chandrasekaran (2007)]. In this p…

FOS: Computer and information sciencesConceptual SpaceCognitive Architectures; Cognitive modeling; Conceptual Spaces; Knowledge representation; Experimental and Cognitive Psychology; Cognitive Neuroscience; Artificial IntelligenceComputer Science - Artificial IntelligenceComputer scienceCognitive NeuroscienceExperimental and Cognitive Psychology02 engineering and technology050105 experimental psychologyCognitive modelingCognitive ArchitecturesConnectionismArtificial IntelligenceConceptual Spaces0202 electrical engineering electronic engineering information engineering0501 psychology and cognitive sciencesSoarCognitive ArchitectureRepresentation (mathematics)Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniCognitive scienceKnowledge level05 social sciencesCommon groundCognitionCLARIONDiagrammatic reasoningArtificial Intelligence (cs.AI)Knowledge representation020201 artificial intelligence & image processingThe SymbolicBiologically Inspired Cognitive Architectures
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