Search results for "Modulo"

showing 10 items of 33 documents

Enumeration of Łukasiewicz paths modulo some patterns

2019

Abstract For any pattern α of length at most two, we enumerate equivalence classes of Łukasiewicz paths of length n ≥ 0 where two paths are equivalent whenever the occurrence positions of α are identical on these paths. As a byproduct, we give a constructive bijection between Motzkin paths and some equivalence classes of Łukasiewicz paths.

Discrete mathematicsMathematics::CombinatoricsModulo020206 networking & telecommunications0102 computer and information sciences02 engineering and technology[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesConstructiveTheoretical Computer ScienceCombinatoricsMathematics::Logic010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0202 electrical engineering electronic engineering information engineeringEnumerationBijectionMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Equivalence classes of permutations modulo descents and left-to-right maxima

2014

Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.

Discrete mathematicsMathematics::CombinatoricsModulo[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]CombinatoricsCatalan numberPermutationMotzkin numberComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]MaximaEquivalence classComputingMilieux_MISCELLANEOUSDescent (mathematics)Bell numberMathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Timed Sets, Functional Complexity, and Computability

2012

AbstractThe construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, distributive restriction categories with an iteration. They provide a categorical basis for modeling functional complexity classes and allow the development of computability within these settings. Indeed, by considering “program objects” and the functions they compute, one can obtain models of computability – i.e. Turing categories – in which the total maps belong to specific complexity classes. Two examples of this are introduced in some detail whi…

Discrete mathematicscomplexity measurescomputabilityTheoretical computer scienceGeneral Computer ScienceBasis (linear algebra)Restriction categoriesComputabilityModuloTuring categoriesfunctional complexityTheoretical Computer ScienceDistributive propertyMathematics::Category TheoryComplexity classCategorical variableTuringcomputerPMathematicscomputer.programming_languageComputer Science(all)Electronic Notes 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

Studio termomeccanico del modulo Limiter del reattore ITER-FEAT

2002

FUSIONE NUCLEARE MODULO LIMITER
researchProduct

On Sets of Words of Rank Two

2019

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⊆ F∗. A submonoid M generated by k elements of A∗ is k-maximal if there does not exist another submonoid generated by at most k words containing M. We call a set X⊆ A∗ primitive if it is the basis of a |X|-maximal submonoid. This extends the notion of primitive word: indeed, 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⊆ Y∗. The set Y is therefore called a primitive root of X. As a main result, we prove that if a set has rank 2, then it has a unique primitive …

Hidden repetitionPrimitive setExistential quantificationBinary rootk-maximal monoidPseudo-repetitionBasis (universal algebra)CombinatoricsSet (abstract data type)RepetitionCardinalityFree monoidRank (graph theory)Primitive root modulo nComputer Science::Formal Languages and Automata TheoryWord (group theory)Mathematics
researchProduct

Generalized Dimension Distortion under Mappings of Sub-Exponentially Integrable Distortion

2010

We prove a dimension distortion estimate for mappings of sub-exponentially integrable distortion in Euclidean spaces, which is essentially sharp in the plane.

Integrable systemMathematics - Complex VariablesGeneral MathematicsModulota111Mathematical analysisData_MISCELLANEOUSComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONData_CODINGANDINFORMATIONTHEORY30C62Distortion (mathematics)Exponential growthDimension (vector space)TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYEuclidean geometryFOS: MathematicsComplex Variables (math.CV)Constant (mathematics)MathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Per ricostruire la Palazzata seicentesca di Messina

2014

L’idea di aprire la città murata di Messina al suo porto, sostituendo la cortina medievale con un prospetto architettonico, è una sfida politica e militare lanciata dalla città alla Corona di Spagna. Il suo esordio ha precisa origine nel 1556, quando il viceré Juan de Vega e lo scultore architetto Giovannangelo Montorsoli avviano l’uso urbano della banchina portuale con la realizzazione del fonte di Nettuno, ispirata dalla opportunità di “passeggiare” sul molo. Negli ultimi anni del Cinquecento Jacopo Del Duca convince inizialmente gli amministratori ad abbattere le mura per costruire il Palazzo del Banco, poi a trasformare l’intera cortina in un prospetto con unico modello iterato. Nel 162…

Mediterranean city harbour facade architectural pattern aristocratic buildings urban gatesCittà mediterranea fronte portuale modulo architettonico palazzi nobiliari porte urbiche.Settore ICAR/18 - Storia Dell'Architettura
researchProduct

Verification of Well-Formed Communicating Recursive State Machines

2008

AbstractIn this paper we introduce a new (non-Turing equivalent) formal model of recursive concurrent programs called well-formed communicating recursive state machines (CRSM). CRSM extend recursive state machines (RSM) by allowing a restricted form of concurrency: a state of a module can be refined into a finite collection of modules (working in parallel) in a potentially recursive manner. Communication is only possible between the activations of modules invoked on the same fork. We study the model-checking problem of CRSM with respect to specifications expressed in a temporal logic that extends CaRet with a parallel operator (ConCaRet). We propose a decision algorithm that runs in time ex…

Model checkingModel checkingTheoretical computer scienceGeneral Computer ScienceComputer scienceInfinite state systemModuloConcurrencyTree automataTheoretical Computer ScienceFormal models of concurrency and recursionTuring machinesymbols.namesakeFormal specificationTemporal logicContext-free specificationsRecursionLinear-time logicsPushdown systemsAbstract interpretationAutomatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESInfinite-state systemsrecursive state machinesymbolsState (computer science)Linear time logicAlgorithmComputer Science(all)
researchProduct

Integration of an LP Solver into Interval Constraint Propagation

2011

This paper describes the integration of an LP solver into iSAT, a Satisfiability Modulo Theories solver that can solve Boolean combinations of linear and nonlinear constraints. iSAT is a tight integration of the well-known DPLL algorithm and interval constraint propagation allowing it to reason about linear and nonlinear constraints. As interval arithmetic is known to be less efficient on solving linear programs, we will demonstrate how the integration of an LP solver can improve the overall solving performance of iSAT.

Nonlinear systemSatisfiability modulo theoriesDPLL algorithmLocal consistencyBoolean combinationInterval (mathematics)SolverAlgorithmMathematicsInterval arithmetic
researchProduct