Search results for "Number"

showing 10 items of 3939 documents

Three-page encoding and complexity theory for spatial graphs

2004

We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting three-page embeddings we introduce the notion of the three-page complexity for spatial graphs. This complexity satisfies the properties of finiteness and additivity under natural operations.

Discrete mathematics[ MATH.MATH-GT ] Mathematics [math]/Geometric Topology [math.GT]Algebra and Number TheoryDegree (graph theory)Semigroup010102 general mathematicsGeometric topologyGeometric Topology (math.GT)01 natural sciences57M25 57M15 57M05Combinatorics010104 statistics & probabilityMathematics - Geometric TopologyCone (topology)Additive functionEncoding (memory)[MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT]FOS: Mathematics0101 mathematicsUnit (ring theory)Ambient isotopyMathematics[MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT]MathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Three cyclic branched covers suffice to determine hyperbolic knots.

2005

Let n > m > 2 be two fixed coprime integers. We prove that two Conway reducible, hyperbolic knots sharing the 2-fold, m-fold and n-fold cyclic branched covers are equivalent. Using previous results by Zimmermann we prove that this implies that a hyperbolic knot is determined by any three of its cyclic branched covers.

Discrete mathematics[ MATH.MATH-GT ] Mathematics [math]/Geometric Topology [math.GT]Quantitative Biology::BiomoleculesAlgebra and Number TheoryCoprime integers010102 general mathematics01 natural sciencesMathematics::Geometric TopologyCombinatoricsKnot (unit)[MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT]0103 physical sciences010307 mathematical physics0101 mathematics[MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT]Mathematics
researchProduct

Elements with square roots in compact groups

2010

The probability that a randomly chosen element has a square root is studied in [1, 2, 8] in the finite case. Here we deal with the infinite case.

Discrete mathematicselements with square rootFunctional square rootGeneral MathematicsprobabilityFinite casecompact groupsUnit squareCombinatoricsSettore MAT/02 - AlgebraSquare rootSettore MAT/05 - Analisi MatematicaSettore MAT/03 - GeometriaElement (category theory)Square numberMathematics
researchProduct

Finitary Representations and Images of Transitive Finitary Permutation Groups

1999

Abstract We characterize the point stabilizers and kernels of finitary permutation representations of infinite transitive groups of finitary permutations. Moreover, the number of such representations is determined.

Discrete mathematicshomomorphic imagesMathematics::CombinatoricsAlgebra and Number Theorypermutation groupsfinitary groupsBit-reversal permutationGeneralized permutation matrixPermutation groupCyclic permutationCombinatoricsMathematics::LogicPermutationwreath productsWreath productMathematics::Category TheoryComputer Science::Logic in Computer ScienceFinitaryPermutation graphMathematicsJournal of Algebra
researchProduct

On second maximal subgroups of Sylow subgroups of finite groups

2011

Abstract Finite groups in which the second maximal subgroups of the Sylow p -subgroups, p a fixed prime, cover or avoid the chief factors of some of its chief series are completely classified.

Discrete mathematicsp-groupAlgebra and Number TheoryComputer Science::Neural and Evolutionary ComputationMathematics::History and OverviewSylow theoremsChief seriesPhysics::History of PhysicsPrime (order theory)Physics::Popular PhysicsMathematics::Group TheoryMaximal subgroupLocally finite groupCover (algebra)MathematicsJournal of Pure and Applied Algebra
researchProduct

Sylow numbers and nilpotent Hall subgroups

2013

Abstract Let π be a set of primes and G a finite group. We characterize the existence of a nilpotent Hall π-subgroup of G in terms of the number of Sylow subgroups for the primes in π.

Discrete mathematicsp-groupComplement (group theory)Pure mathematicsAlgebra and Number TheoryMathematics::Number TheorySylow theoremsCentral seriesHall subgroupMathematics::Group TheoryNormal p-complementLocally finite groupNilpotent groupMathematicsJournal of Algebra
researchProduct

A new solver for incompressible non-isothermal flows in natural and mixed convection over unstructured grids

2022

Abstract In the present paper we propose a new numerical methodology for the solution of 2D non-isothermal incompressible flows for natural and mixed convection in irregular geometries. The governing equations are the Incompressible Navier-Stokes Equations and the Energy Conservation Equation. Fluid velocity and temperature are coupled in the buoyancy term of the momentum equations according to the Oberbeck–Boussinesq approximation. The governing equations are discretized over unstructured triangular meshes satisfying the Delaunay property. Thanks to the Oberbeck–Boussinesq hypothesis, the flow and energy problems are solved in an uncoupled way, and two fractional time step procedures are s…

DiscretizationDelaunay triangulationApplied MathematicsEulerian pathUnstructured meshesSolverNumerical methodSettore ICAR/01 - IdraulicaPhysics::Fluid Dynamicssymbols.namesakeMatrix (mathematics)Flow (mathematics)Natural convectionModeling and SimulationPredictor-corrector schemesymbolsApplied mathematicsIncompressible fluidMixed convectionCondition numberMathematicsNumerical stability
researchProduct

Filtering of Spontaneous and Low Intensity Emotions in Educational Contexts

2015

Affect detection is a challenging problem, even more in educational contexts, where emotions are spontaneous and usually subtle. In this paper, we propose a two-stage detection approach based on an initial binary discretization followed by a specific emotion prediction stage. The binary classification method uses several distinct sources of information to detect and filter relevant time slots from an affective point of view. An accuracy close to 75% at detecting whether the learner has felt an educationally relevant emotion on 20 second time slots has been obtained. These slots can then be further analyzed by a second classifier, to determine the specific user emotion.

DiscretizationPoint (typography)Binary classificationComputer scienceSpeech recognitionClassifier (linguistics)Binary numberFilter (signal processing)Affective computingAffect (psychology)
researchProduct

Guaranteed and computable error bounds for approximations constructed by an iterative decoupling of the Biot problem

2021

The paper is concerned with guaranteed a posteriori error estimates for a class of evolutionary problems related to poroelastic media governed by the quasi-static linear Biot equations. The system is decoupled by employing the fixed-stress split scheme, which leads to an iteratively solved semi-discrete system. The error bounds are derived by combining a posteriori estimates for contractive mappings with functional type error control for elliptic partial differential equations. The estimates are applicable to any approximation in the admissible functional space and are independent of the discretization method. They are fully computable, do not contain mesh-dependent constants, and provide r…

DiscretizationPoromechanics010103 numerical & computational mathematicsContraction mappings01 natural sciencesFOS: MathematicsDecoupling (probability)Applied mathematicsMathematics - Numerical Analysis0101 mathematicsvirheanalyysiMathematicsa posteriori error estimatesosittaisdifferentiaaliyhtälötA posteriori error estimatesfixed-stress split iterative schemeBiot numberNumerical Analysis (math.NA)Biot problem010101 applied mathematicsComputational MathematicsBiot problem; Fixed-stress split iterative scheme; A posteriori error estimates; Contraction mappingsComputational Theory and MathematicsElliptic partial differential equationModeling and SimulationNorm (mathematics)contraction mappingsA priori and a posterioriFixed-stress split iterative schemenumeerinen analyysiapproksimointiError detection and correction
researchProduct

Monte Carlo Simulation of a Modified Chi Distribution with Unequal Variances in the Generating Gaussians. A Discrete Methodology to Study Collective …

2020

The Chi distribution is a continuous probability distribution of a random variable obtained from the positive square root of the sum of k squared variables, each coming from a standard Normal distribution (mean = 0 and variance = 1). The variable k indicates the degrees of freedom. The usual expression for the Chi distribution can be generalised to include a parameter which is the variance (which can take any value) of the generating Gaussians. For instance, for k = 3, we have the case of the Maxwell-Boltzmann (MB) distribution of the particle velocities in the Ideal Gas model of Physics. In this work, we analyse the case of unequal variances in the generating Gaussians whose distribution w…

Distribution (number theory)Chi distributionKeywords: Chi distributionGeneral MathematicsMonte Carlo methodDegrees of freedom (statistics)050109 social psychology02 engineering and technologyMaxwell-Boltzmann distributionNormal distributionsymbols.namesake0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)0501 psychology and cognitive sciencesdiscrete modelStatistical physicsEngineering (miscellaneous)lcsh:Mathematics05 social sciencesVariance (accounting)lcsh:QA1-939Maxwell–Boltzmann distributionPsicologiasymbolsreaction times020201 artificial intelligence & image processingRandom variable
researchProduct