Search results for "Maxima"

showing 10 items of 371 documents

The sequence of open and closed prefixes of a Sturmian word

2017

A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the {\it oc-sequence} of a word, which is the binary sequence whose $n$-th element is $0$ if the prefix of length $n$ of the word is open, or $1$ if it is closed. We exhibit results showing that this sequence is deeply related to the combinatorial and periodic structure of a word. In the case of Sturmian words, we show that these are uniquely determined (up to renaming letters) by their oc-sequence. Moreover, we prove that the class of finite Sturmian words is a maximal element with this property in the class of binar…

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)Sturmian word closed wordComputer Science - Formal Languages and Automata Theory0102 computer and information sciences68R1501 natural sciencesPseudorandom binary sequenceCombinatorics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - Combinatorics0101 mathematicsMathematicsSequenceClosed wordSettore INF/01 - InformaticaApplied Mathematics010102 general mathematicsSturmian wordSturmian wordPrefix010201 computation theory & mathematicsCombinatorics (math.CO)SuffixElement (category theory)Word (computer architecture)Maximal elementComputer Science - Discrete Mathematics
researchProduct

Monoids and Maximal Codes

2011

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal code. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a maxi…

FOS: Computer and information sciencesDiscrete mathematicsMonoidCode (set theory)Formal Languages and Automata Theory (cs.FL)lcsh:MathematicsComputer Science - Formal Languages and Automata TheoryAstrophysics::Cosmology and Extragalactic Astrophysicslcsh:QA1-939lcsh:QA75.5-76.95Set (abstract data type)chemistry.chemical_compoundchemistryFOS: MathematicsMathematics - CombinatoricsOrder (group theory)High Energy Physics::ExperimentCombinatorics (math.CO)lcsh:Electronic computers. Computer scienceCharacteristic propertyPartially ordered setMaximal elementMathematicsElectronic Proceedings in Theoretical Computer Science
researchProduct

Primitive sets of words

2020

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$ is {\em $k$-maximal} if there does not exist another submonoid generated by at most $k$ words containing $M$. We call a set $X \subseteq A^*$ {\em primitive} if it is the basis of a $|X|$-maximal submonoid. This definition encompasses the notion of primitive word -- in fact, $\{w\}$ is a primitive set if and only if $w$ is a primitive word. By definition, for any set $X$, there exists a primitive set $Y$ such that $X \subseteq Y^*$. We therefore call $Y$…

FOS: Computer and information sciencesPrimitive setDiscrete Mathematics (cs.DM)General Computer ScienceFormal Languages and Automata Theory (cs.FL)Pseudo-repetitionComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technology01 natural sciencesTheoretical Computer ScienceCombinatoricsCardinalityFree monoidBi-rootFOS: Mathematics0202 electrical engineering electronic engineering information engineeringMathematics - CombinatoricsRank (graph theory)Primitive root modulo nMathematicsHidden repetitionSettore INF/01 - InformaticaIntersection (set theory)k-maximal monoidFunction (mathematics)Basis (universal algebra)010201 computation theory & mathematics020201 artificial intelligence & image processingCombinatorics (math.CO)Computer Science::Formal Languages and Automata TheoryWord (group theory)Computer Science - Discrete Mathematics
researchProduct

Bayesian inference for the extremal dependence

2016

A simple approach for modeling multivariate extremes is to consider the vector of component-wise maxima and their max-stable distributions. The extremal dependence can be inferred by estimating the angular measure or, alternatively, the Pickands dependence function. We propose a nonparametric Bayesian model that allows, in the bivariate case, the simultaneous estimation of both functional representations through the use of polynomials in the Bernstein form. The constraints required to provide a valid extremal dependence are addressed in a straightforward manner, by placing a prior on the coefficients of the Bernstein polynomials which gives probability one to the set of valid functions. The…

FOS: Computer and information sciencesStatistics and ProbabilityInferenceBernstein polynomialsBivariate analysisBayesian inference01 natural sciencesMethodology (stat.ME)Bayesian nonparametrics010104 statistics & probabilitysymbols.namesakeGeneralised extreme value distribution0502 economics and business62G07Applied mathematics62G05Degree of a polynomial0101 mathematicsStatistics - Methodology050205 econometrics MathematicsAngular measureMax-stable distributionGENERALISED EXTREME VALUE DISTRIBUTION EXTREMAL DEPENDENCE ANGULAR MEASURE MAX-STABLE DISTRIBUTION BERNSTEIN POLYNOMIALS BAYESIAN NONPARAMETRICS TRANS-DIMENSIONAL MCMC EXCHANGE RATEExchange rates05 social sciencesNonparametric statisticsMarkov chain Monte CarloBernstein polynomialGENERALISED EXTREME VALUE DISTRIBUTION; EXTREMAL DEPENDENCE; ANGULAR MEASURE; MAX-STABLE DISTRIBUTION; BERNSTEIN POLYNOMIALS; BAYESIAN NONPARAMETRICS; TRANS-DIMENSIONAL MCMC; EXCHANGE RATETrans-dimensional MCMCEXCHANGE RATEsymbolsStatistics Probability and UncertaintySettore SECS-S/01 - StatisticaMaximaExtremal dependence62G32Electronic Journal of Statistics
researchProduct

Bootstrap validation of links of a minimum spanning tree

2018

We describe two different bootstrap methods applied to the detection of a minimum spanning tree obtained from a set of multivariate variables. We show that two different bootstrap procedures provide partly distinct information that can be highly informative about the investigated complex system. Our case study, based on the investigation of daily returns of a portfolio of stocks traded in the US equity markets, shows the degree of robustness and completeness of the information extracted with popular information filtering methods such as the minimum spanning tree and the planar maximally filtered graph. The first method performs a "row bootstrap" whereas the second method performs a "pair bo…

FOS: Computer and information sciencesStatistics and ProbabilityMultivariate statisticsCorrelation coefficientCovariance matrixReplicaComplex systemMinimum spanning treeCondensed Matter Physics01 natural sciencesSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Minimum spanning tree Bootstrap Planar maximally filtered graph Information filtering Proximity based networks Random matrix theory010305 fluids & plasmasMethodology (stat.ME)0103 physical sciencesStatistics010306 general physicsRandom matrixStatistics - MethodologyMathematics
researchProduct

Flexibility of TTF. a theoretical study

1999

Abstract The folding of tetrathiafulvalene along the S···S axes has been investigated using highly-accurate quantum-chemical calculations. A very flat, two-fold potential is found for neutral TTF where minima correspond to boat conformations (θ ≈ 15–20 °). The flatness of the folding potential indicates that TTF is conformationally more flexible than usually thought.

Flexibility (anatomy)ChemistryMechanical EngineeringFlatness (systems theory)Metals and AlloysCondensed Matter PhysicsElectronic Optical and Magnetic MaterialsFolding (chemistry)Maxima and minimachemistry.chemical_compoundmedicine.anatomical_structureMechanics of MaterialsChemical physicsAb initio quantum chemistry methodsComputational chemistryMaterials ChemistrymedicineMoleculeTetrathiafulvaleneSynthetic Metals
researchProduct

The Intersection of $3$-Maximal Submonids

2020

Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially decomposed into at most $k$ words. We characterize the intersection in the case of two $3$-maximal monoids.

Free graphSettore INF/01 - InformaticaGeneral Computer ScienceMathematics::Category Theory3-maximal monoidsMathematics - CombinatoricsComputer Science - Formal Languages and Automata Theory68R15IntersectionTheoretical Computer Science
researchProduct

On a class of generalised Schmidt groups

2015

In this paper families of non-nilpotent subgroups covering the non-nilpotent part of a finite group are considered. An A 5 -free group possessing one of these families is soluble, and soluble groups with this property have Fitting length at most three. A bound on the number of primes dividing the order of the group is also obtained.

Group (mathematics)Applied MathematicsMathematics::Rings and AlgebrasGrups Teoria deCycle graph (algebra)Sporadic groupFinite groupsNon-abelian groupCombinatoricsMathematics::Group TheoryGroup of Lie typeLocally finite groupSimple groupNilpotent groupsMaximal subgroupsOrder (group theory)ÀlgebraMATEMATICA APLICADAMathematics::Representation TheoryMathematicsAnnali di Matematica Pura ed Applicata (1923 -)
researchProduct

Correlation at Low Temperature: II. Asymptotics

2004

The present paper is a continuation of ref. 4, where the truncated two-point correlation function for a class of lattice spin systems was proved to have exponential decay at low temperature, under a weak coupling assumption. In this paper we compute the asymptotics of the correlation function as the temperature goes to zero. This paper thus extends ref. 3 in two directions: The Hamiltonian function is allowed to have several local minima other than a unique global minimum, and we do not require translation invariance of the Hamiltonian function. We are in particular able to handle spin systems on a general lattice.

Hamiltonian mechanicsMathematical analysisCrystal systemStatistical and Nonlinear PhysicsCorrelationMaxima and minimaContinuationsymbols.namesakeLattice (order)symbolsExponential decayLaplace operatorMathematical PhysicsMathematicsMathematical physicsJournal of Statistical Physics
researchProduct

Association of cardio-pulmonary stress test parameters and heart rate recovery in obese subjects with or without type II diabetes

2016

Background and Objectives: Heart rate recovery at first (HRR-I) and second (HRR-II) minute after exercise is accurate in estimating autonomic nervous system balance, and has been related to risk of cardiovascular events. Our aim was to determine independent predictors of HRR collected during standard cardio-pulmonary stress test (CPT) in a group of overweight/obese subjects without (N=14) and with type 2 diabetes (N=19), as compared to a sample (N=15) of healthy sedentary subjects. Methods: A graded exercise test on treadmill was performed. Oxygen uptake at rest and at peak exercise (VO2max), as well as respiratory exchange ratio at peak exercise was collected. Linear and logistic regressio…

Heart rate recoveryMaximal oxygen uptake (VO2Cardio-Pulmonary Stress Test Heart Rate Recovery Autonomic Nervous SystemAutonomic nervous systemmax)Settore M-EDF/01 - Metodi E Didattiche Delle Attivita' MotorieCardio-pulmonary stress test
researchProduct