Search results for "Number"

showing 10 items of 3939 documents

Mond's conjecture for maps between curves

2017

A theorem by D. Mond shows that if f:(C,0)→C2,0 is finite and has has degree one onto its image (Y, 0), then the Ae-codimension is less than or equal to the image Milnor number μI(f), with equality if and only if (Y, 0) is weighted homogeneous. Here we generalize this result to the case of a map germ f:(X,0)→C2,0, where (X, 0) is a plane curve singularity.

ConjectureDegree (graph theory)Plane curveGeneral MathematicsImage (category theory)010102 general mathematicsMathematical analysisCodimension01 natural sciencesMilnor numberCombinatoricsSingularity0103 physical sciencesGerm010307 mathematical physics0101 mathematicsMathematicsMathematische Nachrichten
researchProduct

The Topology of the Milnor Fibration

2020

The fibration theorem for analytic maps near a critical point published by John Milnor in 1968 is a cornerstone in singularity theory. It has opened several research fields and given rise to a vast literature. We review in this work some of the foundational results about this subject, and give proofs of several basic “folklore theorems” which either are not in the literature, or are difficult to find. Examples of these are that if two holomorphic map-germs are isomorphic, then their Milnor fibrations are equivalent, or that the Milnor number of a complex isolated hypersurface or complete intersection singularity \((X, \underline {0})\) does not depend on the choice of functions that define …

ConjectureSingularitySingularity theoryElementary proofComplete intersectionFibrationHolomorphic functionTopologyMathematicsMilnor number
researchProduct

2-Groups with few rational conjugacy classes

2011

Abstract In this paper we prove the following conjecture of G. Navarro: if G is a finite 2-group with exactly 5 rational conjugacy classes, then G is dihedral, semidihedral or generalized quaternion. We also characterize the 2-groups with 4 rational classes.

Conjugacy classesDiscrete mathematicsMathematics::Group TheoryPure mathematicsConjectureConjugacy classAlgebra and Number TheoryDihedral angleQuaternion2-GroupsMathematicsJournal of Algebra
researchProduct

Conjugacy problem for braid groups and Garside groups

2003

We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).

Conjugacy problemBraid group20F36Geometric topologyGarside groupsGroup Theory (math.GR)0102 computer and information sciencesAlgebraic topology01 natural sciencesTorus knotCombinatoricsMathematics - Geometric TopologyMathematics::Group TheoryMathematics::Quantum AlgebraFOS: MathematicsAlgebraic Topology (math.AT)Mathematics - Algebraic Topology0101 mathematics20F36; 20F10MathematicsSmall Gaussian groupsAlgebra and Number Theory010102 general mathematicsConjugacy problemBraid groupsGeometric Topology (math.GT)Braid theoryMathematics::Geometric TopologyArtin groups010201 computation theory & mathematicsArtin group20F10Mathematics - Group TheoryGroup theory
researchProduct

Two-view “cylindrical decomposition” of binary images

2001

This paper describes the discrete cylindrical algebraic decomposition (DCAD) construction along two orthogonal views of binary images. The combination of two information is used to avoid ambiguities for image recognition purposes. This algorithm associates an object connectivity graph to each connected component, allowing a complete description of the structuring information. Moreover, an easy and compact representation of the scene is achieved by using strings in a five letter alphabet. Examples on complex digital images are also provided. © 2001 Elsevier Science Inc.

Connected componentNumerical AnalysisAlgebra and Number TheoryTheoretical computer scienceSettore INF/01 - InformaticaBinary imageObject (computer science)StructuringCylindrical algebraic decompositionString representationDigital imageImage decompositionComputer Science::Computer Vision and Pattern RecognitionDecomposition (computer science)Discrete Mathematics and CombinatoricsGeometry and TopologyRepresentation (mathematics)AlgorithmShape descriptionMathematicsLinear Algebra and its Applications
researchProduct

Do Individual Effects Reflect Quantitative or Qualitative Differences in Cognition?

2021

Rouder and Haaf (2020) posed the important question if there are some individuals whose behavior is not in accordance with well-established experimental effects and whether these individual differences are quantitative or qualitative in nature. In our commentary, we discuss the distinction between quantitative and qualitative individual differences and between individual and average causal effects and come to the conclusion that this is not a new question, but in fact one that has already been discussed by Gordon W. Allport (1937) and Donald B. Rubin (1974, 1978). Moreover, we critically examine their proposed rule of thumb to collect about 100 trials per experimental condition to reliably …

Consciousness. CognitionElementary cognitive taskmedia_common.quotation_subjectCausal effectExperimental and Cognitive PsychologyCognitioncognitive tasksMeasure (mathematics)Rule of thumbtrial numbersCommentaryFunction (engineering)Psychologyindividual differencesindividual differences; cognitive tasks; trial numbersBF309-499Cognitive psychologymedia_commonJournal of Cognition
researchProduct

On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection

2013

We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…

Consensus algorithmTheoretical computer scienceComputer scienceDistributed computingVisibility (geometry)Binary numberValue (computer science)Topology (electrical circuits)Computer Science::Multiagent SystemsSettore ING-INF/04 - AutomaticaControl and Systems EngineeringConsensus distributed algorithms intrusion detection security.Bounded functionConvergence (routing)Electrical and Electronic EngineeringVector-valued function
researchProduct

Adaptive mesh reconstruction for hyperbolic conservation laws with total variation bound

2012

We consider 3-point numerical schemes, that resolve scalar conservation laws, that are oscillatory either to their dispersive or anti-diffusive nature. The spatial discretization is performed over non-uniform adaptively redefined meshes. We provide a model for studying the evolution of the extremes of the oscillations. We prove that proper mesh reconstruction is able to control the oscillations; we provide bounds for the Total Variation (TV) of the numerical solution. We, moreover, prove under more strict assumptions that the increase of the TV, due to the oscillatory behavior of the numerical schemes, decreases with time; hence proving that the overall scheme is TV Increase-Decreasing (TVI…

Conservation lawAlgebra and Number TheoryDiscretizationApplied MathematicsScalar (mathematics)Time evolutionRegular polygonTopologyComputational Mathematicssymbols.namesakeRiemann problemMathematics Subject ClassificationsymbolsApplied mathematicsPolygon meshMathematicsMathematics of Computation
researchProduct

Partial self-consistency and analyticity in many-body perturbation theory: Particle number conservation and a generalized sum rule

2016

We consider a general class of approximations which guarantees the conservation of particle number in many-body perturbation theory. To do this we extend the concept of $\Phi$-derivability for the self-energy $\Sigma$ to a larger class of diagrammatic terms in which only some of the Green's function lines contain the fully dressed Green's function $G$. We call the corresponding approximations for $\Sigma$ partially $\Phi$-derivable. A special subclass of such approximations, which are gauge-invariant, is obtained by dressing loops in the diagrammatic expansion of $\Phi$ consistently with $G$. These approximations are number conserving but do not have to fulfill other conservation laws, such…

Conservation lawConservation of energyapproximationsStrongly Correlated Electrons (cond-mat.str-el)ta114Particle numberparticle number conservationFOS: Physical sciencesSigma02 engineering and technologymany-body perturbation theoryGreen's function021001 nanoscience & nanotechnology01 natural sciencesCondensed Matter - Strongly Correlated ElectronsContinuity equationQuantum mechanics0103 physical sciencesSum rule in quantum mechanics010306 general physics0210 nano-technologyFermi gasAnderson impurity modelMathematical physicsMathematics
researchProduct

Isobaric Vapor−Liquid Equilibrium of Binary Mixtures of 1-Butanol + Chlorobenzene and 2-Butanol + Chlorobenzene at 20 and 100 kPa

1997

Isobaric vapor−liquid equilibria were obtained for 1-butanol + chlorobenzene and for 2-butanol + chlorobenzene systems at 20 and 100 kPa using a dynamic still. The experimental error in temperature was ±0.1 K, in pressure ±0.01 kPa and ±0.1 kPa for the experiments carried out at 20 and 100 kPa, respectively, and in liquid and vapor composition ±0.001. The two systems satisfy the point-to-point thermodynamic consistency test. Both systems show a positive deviation from ideality. The data were correlated with the Wilson equation.

Consistency testchemistry.chemical_compoundChemistryChlorobenzeneGeneral Chemical EngineeringButanolVapor–liquid equilibriumThermodynamicsIsobaric processBinary numberGeneral Chemistry2-ButanolJournal of Chemical & Engineering Data
researchProduct