Search results for "Combinatorics"

showing 10 items of 1770 documents

Commensurability in Artin groups of spherical type

2019

Let $A$ and $A'$ be two Artin groups of spherical type, and let $A_1,\dots,A_p$ (resp. $A'_1,\dots,A'_q$) be the irreducible components of $A$ (resp. $A'$). We show that $A$ and $A'$ are commensurable if and only if $p=q$ and, up to permutation of the indices, $A_i$ and $A'_i$ are commensurable for every $i$. We prove that, if two Artin groups of spherical type are commensurable, then they have the same rank. For a fixed $n$, we give a complete classification of the irreducible Artin groups of rank $n$ that are commensurable with the group of type $A_n$. Note that it will remain 6 pairs of groups to compare to get the complete classification of Artin groups of spherical type up to commensur…

Primary 20F36 Secondary 57M07 20B30Group (mathematics)General MathematicsSpherical typeGeometric Topology (math.GT)Group Theory (math.GR)Type (model theory)Rank (differential topology)Commensurability (mathematics)CombinatoricsPermutationMathematics - Geometric TopologyMathematics::Group TheoryFOS: MathematicsMathematics - Group TheoryMathematics
researchProduct

Unirationality of Hurwitz spaces of coverings of degree <= 5

2011

Let $Y$ be a smooth, projective curve of genus $g\geq 1$ over the complex numbers. Let $H^0_{d,A}(Y)$ be the Hurwitz space which parametrizes coverings $p:X \to Y$ of degree $d$, simply branched in $n=2e$ points, with monodromy group equal to $S_d$, and $det(p_{*}O_X/O_Y)$ isomorphic to a fixed line bundle $A^{-1}$ of degree $-e$. We prove that, when $d=3, 4$ or $5$ and $n$ is sufficiently large (precise bounds are given), these Hurwitz spaces are unirational. If in addition $(e,2)=1$ (when $d=3$), $(e,6)=1$ (when $d=4$) and $(e,10)=1$ (when $d=5$), then these Hurwitz spaces are rational.

Projective curveHurwitz spaceDegree (graph theory)Group (mathematics)General MathematicsSpace (mathematics)unirationalitycoveringvector bundles.CombinatoricsMathematics - Algebraic GeometryMonodromyLine bundle14H10 (Primary) 14H30 (Secondary)Genus (mathematics)Settore MAT/03 - GeometriaComplex numberMathematics
researchProduct

Singular quasisymmetric mappings in dimensions two and greater

2018

For all $n \geq 2$, we construct a metric space $(X,d)$ and a quasisymmetric mapping $f\colon [0,1]^n \rightarrow X$ with the property that $f^{-1}$ is not absolutely continuous with respect to the Hausdorff $n$-measure on $X$. That is, there exists a Borel set $E \subset [0,1]^n$ with Lebesgue measure $|E|&gt;0$ such that $f(E)$ has Hausdorff $n$-measure zero. The construction may be carried out so that $X$ has finite Hausdorff $n$-measure and $|E|$ is arbitrarily close to 1, or so that $|E| = 1$. This gives a negative answer to a question of Heinonen and Semmes.

Property (philosophy)General MathematicsExistential quantificationMathematics::General Topology01 natural sciencesfunktioteoriaCombinatoricsMathematics - Metric Geometry0103 physical sciences30L10FOS: MathematicsMathematics::Metric Geometry0101 mathematicsMathematicsLebesgue measuremetric space010102 general mathematicsHausdorff spaceZero (complex analysis)quasiconformal mappingMetric Geometry (math.MG)Absolute continuity16. Peace & justicemetriset avaruudetMetric spaceabsolute continuity010307 mathematical physicsBorel set
researchProduct

On the arithmetically Cohen-Macaulay property for sets of points in multiprojective spaces

2017

We study the arithmetically Cohen-Macaulay (ACM) property for finite sets of points in multiprojective spaces, especially ( P 1 ) n (\mathbb P^1)^n . A combinatorial characterization, the ( ⋆ ) (\star ) -property, is known in P 1 × P 1 \mathbb P^1 \times \mathbb P^1 . We propose a combinatorial property, ( ⋆ s ) (\star _s) with 2 ≤ s ≤ n 2\leq s\leq n , that directly generalizes the ( ⋆ ) (\star ) -property to ( P 1 ) n (\mathbb P^1)^n for larger n n . We show that X X is ACM if and only if it satisfies the ( ⋆ n ) (\star _n) -property. The main tool for several of our results is an extension to the multiprojective setting of certain liaison methods in projective space.

Property (philosophy)General MathematicsStar (game theory)Arithmetically Cohen-Macaulay; Linkage; Points in multiprojective spacescohen- macaulayCharacterization (mathematics)Commutative Algebra (math.AC)01 natural sciencesCombinatoricsMathematics - Algebraic GeometryPoints in multiprojective spaces0103 physical sciencesFOS: MathematicsProjective space0101 mathematicsFinite setAlgebraic Geometry (math.AG)multiprojective spacesMathematicsDiscrete mathematicsMathematics::Commutative AlgebraLinkageArithmetically Cohen-Macaulay Linkage Points in multiprojective spacesApplied Mathematics010102 general mathematicsExtension (predicate logic)Mathematics - Commutative AlgebraArithmetically Cohen-MacaulaypointsSettore MAT/02 - Algebracohen- macaulay multiprojective spaces points010307 mathematical physicsSettore MAT/03 - Geometria
researchProduct

PreGarside monoids and groups, parabolicity, amalgamation, and FC property

2012

We define the notion of preGarside group slightly lightening the definition of Garside group so that all Artin–Tits groups are preGarside groups. This paper intends to give a first basic study on these groups. Firstly, we introduce the notion of parabolic subgroup, we prove that any preGarside group has a (partial) complemented presentation, and we characterize the parabolic subgroups in terms of these presentations. Afterwards we prove that the amalgamated product of two preGarside groups along a common parabolic subgroup is again a preGarside group. This enables us to define the family of preGarside groups of FC type as the smallest family of preGarside groups that contains the Garside g…

Property (philosophy)[ MATH.MATH-GR ] Mathematics [math]/Group Theory [math.GR]Group (mathematics)General Mathematics010102 general mathematics20F36Group Theory (math.GR)Type (model theory)01 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]CombinatoricsMathematics::Group TheoryProduct (mathematics)0103 physical sciencesFOS: Mathematics010307 mathematical physicsWord problem (mathematics)0101 mathematicsAlgebraic numberMathematics - Group TheoryMathematics
researchProduct

A Stevedore's protein knot.

2009

Protein knots, mostly regarded as intriguing oddities, are gradually being recognized as significant structural motifs. Seven distinctly knotted folds have already been identified. It is by and large unclear how these exceptional structures actually fold, and only recently, experiments and simulations have begun to shed some light on this issue. In checking the new protein structures submitted to the Protein Data Bank, we encountered the most complex and the smallest knots to date: A recently uncovered α-haloacid dehalogenase structure contains a knot with six crossings, a so-called Stevedore knot, in a projection onto a plane. The smallest protein knot is present in an as yet unclassified …

Protein FoldingHydrolasesProtein ConformationComputational Biology/Macromolecular Structure Analysis02 engineering and technologyBiologyMolecular Dynamics SimulationComputational Biology/Molecular DynamicsCombinatorics03 medical and health sciencesCellular and Molecular NeuroscienceKnot (unit)Protein structureGeneticsStructural motifDatabases ProteinMolecular Biologylcsh:QH301-705.5Ecology Evolution Behavior and Systematics030304 developmental biology0303 health sciencesTopological complexityQuantitative Biology::BiomoleculesEcologycomputer.file_format021001 nanoscience & nanotechnologyProtein Data BankMathematics::Geometric TopologyComputational Theory and MathematicsBiochemistrylcsh:Biology (General)Modeling and SimulationProtein foldingStevedore knot0210 nano-technologySingle loopcomputerResearch ArticlePLoS Computational Biology
researchProduct

A Constructive Arboricity Approximation Scheme

2020

The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.

PseudoforestArboricityApproximation algorithm0102 computer and information sciences02 engineering and technology01 natural sciencesConstructiveCombinatoricsSet (abstract data type)Computer Science::Discrete Mathematics010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Partition (number theory)020201 artificial intelligence & image processingMatroid partitioningComputer Science::Data Structures and AlgorithmsGeneralLiterature_REFERENCE(e.g.dictionariesencyclopediasglossaries)Computer Science::Distributed Parallel and Cluster ComputingMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

Some classes of finite groups and mutually permutable products

2008

[EN] This paper is devoted to the study of mutually permutable products of finite groups. A factorised group G=AB is said to be a mutually permutable product of its factors A and B when each factor permutes with every subgroup of the other factor. We prove that mutually permutable products of Y-groups (groups satisfying a converse of Lagrange's theorem) and SC-groups (groups whose chief factors are simple) are SC-groups, by means of a local version. Next we show that the product of pairwise mutually permutable Y-groups is supersoluble. Finally, we give a local version of the result stating that when a mutually permutable product of two groups is a PST-group (that is, a group in which every …

Pst-groupFinite groupMathematics::CombinatoricsAlgebra and Number TheoryY-groupGrups Teoria deSc-groupAlgebraMathematics::Group TheoryPermutabilityMutually permutable productÀlgebraPermutable primeFinite groupAlgebra over a fieldMATEMATICA APLICADAMathematicsJournal of Algebra
researchProduct

The diamond partial order in rings

2013

In this paper we introduce a new partial order on a ring, namely the diamond partial order. This order is an extension of a partial order defined in a matrix setting in [J.K. Baksalary and J. Hauke, A further algebraic version of Cochran's theorem and matrix partial orderings, Linear Algebra and its Applications, 127, 157--169, 1990]. We characterize the diamond partial order on rings and study its relationships with other partial orders known in the literature. We also analyze successors, predecessors and maximal elements under the diamond order.

Pure mathematics15A09Principal ideal010103 numerical & computational mathematicsengineering.material01 natural sciencesCombinatoricsMatrix (mathematics)Linear extensionPrincipal ideal0101 mathematicsCiências Naturais::MatemáticasMathematicsRing (mathematics)RingAlgebra and Number TheoryScience & Technology010102 general mathematicsAnells (Algebra)DiamondOrder (ring theory)Sharp partial orderStar partial orderMinus partial order06A06Linear algebraengineeringÀlgebra linealMATEMATICA APLICADAMaximal element:Matemáticas [Ciências Naturais]
researchProduct

ON A QUESTION OF BEIDLEMAN AND ROBINSON

2002

[EN] In [J. C. Beidleman, D. J. S. Robinson, J. Algebra 1997, 191, 686--703, Theorem A], Beidleman and Robinson proved that if a group satisfies the permutizer condition, it is soluble, its chief factors have order a prime number or 4 and G induces the full group of automorphisms in the chief factors of order 4. In this paper, we show that the converse of this theorem is false by showing some counterexamples. We also find some sufficient conditions for a group satisfying the converse of that theorem to satisfy the permutizer condition.

Pure mathematicsAlgebra and Number TheoryFinite soluble groupGroup (mathematics)Permutizer conditionPrime numberGrups Teoria deAutomorphismCombinatoricsConverseChief factorOrder (group theory)ÀlgebraAlgebra over a fieldMATEMATICA APLICADAMathematicsCounterexampleCommunications in Algebra
researchProduct