Search results for "Decomposition"

showing 10 items of 766 documents

Quasianalytic Denjoy-Carleman classes and o-minimality

2003

We show that the expansion of the real field generated by the functions of a quasianalytic Denjoy-Carleman class is model complete and o-minimal, provided that the class satisfies certain closure conditions. Some of these structures do not admit analytic cell decomposition, and they show that there is no largest o-minimal expansion of the real field.

CombinatoricsClass (set theory)Mathematics::Complex VariablesApplied MathematicsGeneral MathematicsMathematics::Classical Analysis and ODEsClosure (topology)Resolution of singularitiesCell decompositionMathematicsReal fieldJournal of the American Mathematical Society
researchProduct

Class Decomposition for Gastric Cancer Detection from Breath

2021

CombinatoricsDecomposition (computer science)Cancer detectionClass (biology)Mathematics2021 62nd International Scientific Conference on Information Technology and Management Science of Riga Technical University (ITMS)
researchProduct

Lifting paths on quotient spaces

2009

Abstract Let X be a compactum and G an upper semi-continuous decomposition of X such that each element of G is the continuous image of an ordered compactum. If the quotient space X / G is the continuous image of an ordered compactum, under what conditions is X also the continuous image of an ordered compactum? Examples around the (non-metric) Hahn–Mazurkiewicz Theorem show that one must place severe conditions on G if one wishes to obtain positive results. We prove that the compactum X is the image of an ordered compactum when each g ∈ G has 0-dimensional boundary. We also consider the case when G has only countably many non-degenerate elements. These results extend earlier work of the firs…

CombinatoricsDecompositionPure mathematicsImage (category theory)Null familyOrdered continuumBoundary (topology)Geometry and TopologyElement (category theory)Quotient space (linear algebra)QuotientLifting images of arcsMathematicsTopology and its Applications
researchProduct

Semisimple Lie Algebras

1989

Let F be the field of real or complex numbers. A Lie algebra is a vector space g over F with a Lie product (or commutator) [·,·]: g × g → g such that $$x \mapsto \left[ {x,y} \right]\;is\;linear\;for\;any\;y \in g,$$ (1) $$\left[ {x,y} \right] =- \left[ {y,x} \right],$$ (2) $$\left[ {x,\left[ {y,z} \right]} \right] + \left[ {y,\left[ {z,x} \right]} \right] + \left[ {z,\left[ {x,y} \right]} \right] = 0.$$ (3) The last condition is called the Jacobi identity. From (1) and (2) it follows that also y ↦ [x,y] is linear for any x ∈ g. In this chapter we shall consider only fini te-dimensional Lie algebras. In any vector space g one can always define a trivial Lie product [x,y] = 0. A Lie algebra …

CombinatoricsPhysicsProduct (mathematics)Simple Lie groupLie algebraCartan decompositionReal formKilling formLie conformal algebraGraded Lie algebra
researchProduct

K4-free Graphs as a Free Algebra

2017

International audience; Graphs of treewidth at most two are the ones excluding the clique with four vertices (K4) as a minor, or equivalently, the graphs whose biconnected components are series-parallel. We turn those graphs into a finitely presented free algebra, answering positively a question by Courcelle and Engelfriet, in the case of treewidth two. First we propose a syntax for denoting these graphs: in addition to parallel composition and series composition, it suffices to consider the neutral elements of those operations and a unary transpose operation. Then we give a finite equational presentation and we prove it complete: two terms from the syntax are congruent if and only if they …

Completeness000 Computer science knowledge general worksGraph minors[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Graph theoryTree decompositions[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Àlgebra universalUniversal Algebra[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Computer Science::Discrete MathematicsComputer ScienceAxiomatisation[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
researchProduct

A Lebesgue-type decomposition for non-positive sesquilinear forms

2018

A Lebesgue-type decomposition of a (non necessarily non-negative) sesquilinear form with respect to a non-negative one is studied. This decomposition consists of a sum of three parts: two are dominated by an absolutely continuous form and a singular non-negative one, respectively, and the latter is majorized by the product of an absolutely continuous and a singular non-negative forms. The Lebesgue decomposition of a complex measure is given as application.

Complex measurePure mathematicsSesquilinear formType (model theory)Lebesgue integration01 natural sciencesRegularitysymbols.namesakeSettore MAT/05 - Analisi MatematicaLebesgue decomposition0103 physical sciencesDecomposition (computer science)Complex measureFOS: Mathematics0101 mathematicsMathematicsMathematics::Functional AnalysisSingularitySesquilinear formApplied Mathematics010102 general mathematicsAbsolute continuityFunctional Analysis (math.FA)Mathematics - Functional Analysis47A07 15A63 28A12 47A12Product (mathematics)symbols010307 mathematical physicsNumerical range
researchProduct

Evaluation of sewage sludge-based compost by FT-IR spectroscopy

2006

The aerobic batch composting fermentations of sewage sludge with wood chips and maturity compost as co-composting additives were carried out in an open type lab-scale reactor. Fourier transform infrared spectroscopy (FT-IR) spectroscopy was used to monitor the composting process, evaluate the degradation rate and thus determine the maturity. Although the composition of the input mixture strongly affects the shape of the infrared (IR) spectra, typical bands of components can be selected and used to follow the composting process. The appearance, shape and intensity of the nitrate band at 1384 cm 1 was well pronounced and evident for a sewage sludgebased compost maturity. An increase of the pe…

CompostAnalytical chemistrySoil ScienceInfrared spectroscopyengineering.materialDecompositionchemistry.chemical_compoundNitratechemistryengineeringFourier transform infrared spectroscopyAbsorption (electromagnetic radiation)SpectroscopySludgeGeoderma
researchProduct

ChemInform Abstract: Evidence for the Formation of 1,3- and 1,4-Dehydrobenzenes in the Thermal Decomposition of Diaryliodonium-carboxylates.

1987

Abstract Abstract: Generation of m- and p-benzynes in decomposition of diaryliodonium- 3- and 4-carboxylates is demonstrated by three-phase method.

Computational chemistryChemistryThermal decompositionGeneral MedicineDecompositionChemInform
researchProduct

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

Cholesky decomposition techniques in electronic structure theory

2011

We review recently developed methods to efficiently utilize the Cholesky decomposition technique in electronic structure calculations. The review starts with a brief introduction to the basics of the Cholesky decomposition technique. Subsequently, examples of applications of the technique to ab inito procedures are presented. The technique is demonstrated to be a special type of a resolution-of-identity or density-fitting scheme. This is followed by explicit examples of the Cholesky techniques used in orbital localization, computation of the exchange contribution to the Fock matrix, in MP2, gradient calculations, and so-called method specific Cholesky decomposition. Subsequently, examples o…

Computer and Information SciencesTheoretical computer scienceBasis (linear algebra)Computer scienceCalibration (statistics)ComputationAb initioMathematicsofComputing_NUMERICALANALYSISData- och informationsvetenskapKemiType (model theory)Fock matrixChemical SciencesPruning (decision trees)AlgorithmCholesky decomposition
researchProduct