Search results for "combinatoric"

showing 10 items of 1776 documents

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

Remarks on iteration of formal automorphisms

1988

Etude de l'iteration des automorphismes formels. Generalisation et interpretation d'un critere de Reich-Schwaiger

Pure mathematicsApplied MathematicsGeneral MathematicsFunctional equationMathematical analysisDiscrete Mathematics and CombinatoricsAutomorphismGroup theoryMathematicsAequationes Mathematicae
researchProduct

On the composition and decomposition of positive linear operators (VII)

2021

In the present paper we study the compositions of the piecewise linear interpolation operator S?n and the Beta-type operator B?n, namely An:= S?n ?B?n and Gn := B?n ? S?n. Voronovskaya type theorems for the operators An and Gn are proved, substantially improving some corresponding known results. The rate of convergence for the iterates of the operators Gn and An is considered. Some estimates of the differences between An, Gn, Bn and S?n, respectively, are given. Also, we study the behaviour of the operators An on the subspace of C[0,1] consisting of all polygonal functions with nodes {0, 1/2,..., n-1/n,1}. Finally, we propose to the readers a conjecture concerning the eigenvalues of the ope…

Pure mathematicsApplied MathematicsLinear operatorsDecomposition (computer science)Discrete Mathematics and CombinatoricsComposition (combinatorics)AnalysisMathematicsApplicable Analysis and Discrete Mathematics
researchProduct

Multiple solutions for a Neumann-type differential inclusion problem involving the p(.)-Laplacian

2012

Using a multiple critical points theorem for locally Lipschitz continuous functionals, we establish the existence of at least three distinct solutions for a Neumann-type differential inclusion problem involving the $p(\cdot)$-Laplacian.

Pure mathematicsApplied Mathematicsthree-critical-points theoremdifferential inclusion problemType (model theory)Lipschitz continuityDifferential inclusionCritical points of locally Lipschitz continuous functionalcritical points of locally Lipschitz continuous functionalsp-LaplacianDiscrete Mathematics and Combinatoricsp(x)-Laplacian; variable exponent Sobolev space; critical points of locally Lipschitz continuous functionals; differential inclusion problem; three-critical-points theoremp(x)-Laplacianvariable exponent Sobolev spaceAnalysisMathematics
researchProduct

Approximation properties of λ-Kantorovich operators

2018

In the present paper, we study a new type of Bernstein operators depending on the parameter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\lambda\in[-1,1]$\end{document}λ∈[−1,1]. The Kantorovich modification of these sequences of linear positive operators will be considered. A quantitative Voronovskaja type theorem by means of Ditzian–Totik modulus of smoothness is proved. Also, a Grüss–Voronovskaja type theorem for λ-Kantorovich operators is provided. Some numerical examples which show the relevance of the res…

Pure mathematicsBernstein operatorModulus of smoothnessResearchApplied Mathematicslcsh:Mathematics010102 general mathematicsType (model theory)Rate of convergenceLambdalcsh:QA1-93901 natural sciences010101 applied mathematicsRate of convergenceVoronovskaja theorem41A10Discrete Mathematics and CombinatoricsKantorovich operators0101 mathematics41A2541A36AnalysisMathematicsJournal of Inequalities and Applications
researchProduct

Stability of the Calderón problem in admissible geometries

2014

In this paper we prove log log type stability estimates for inverse boundary value problems on admissible Riemannian manifolds of dimension n ≥ 3. The stability estimates correspond to the uniqueness results in [13]. These inverse problems arise naturally when studying the anisotropic Calderon problem. peerReviewed

Pure mathematicsCalderón problemControl and Optimizationta111Stability (learning theory)InversestabilityInverse problemType (model theory)Dimension (vector space)Log-log plotModeling and SimulationInverse boundary value problemsDiscrete Mathematics and CombinatoricsPharmacology (medical)UniquenessBoundary value problemAnalysisMathematicsInverse Problems & Imaging
researchProduct