Search results for "combinatoric"

showing 10 items of 1776 documents

Si j'aurai su, j'aurai pas venu" : éclairage stratégique sur le lancement simultané des deux " Guerre des Boutons "

2014

“If I knew, I will not come”: strategic insight on the simultaneous launch of the two Guerre des BoutonsThe purpose of this paper is to propose an insight on an unusual strategic situation in the movie industry: thesimultaneous launch on screens of two almost identical movies, La Guerre des Boutons. After recalling the stakesattached to the product launch in the film industry, a monograph devoted to this direct confrontation, supplementedby an analysis of the critics of spectators, is proposed. This analysis reveals determinants (the conflictand lack of control in the film industry) and consequences (sub-optimal strategy) of the temporal agglomeration.

agglomération temporelle.film industryconflictconflitGeneral Medicinenew product introductiontemporal agglomerationCombinatoricslaunch datefilière cinématographique[SHS.GESTION]Humanities and Social Sciences/Business administrationnouveau produitpréannoncedate de lancement[SHS.GESTION] Humanities and Social Sciences/Business administration[ SHS.GESTION ] Humanities and Social Sciences/Business administrationHumanitiespreannouncementMathematics
researchProduct

On the tensor degree of finite groups

2013

We study the number of elements $x$ and $y$ of a finite group $G$ such that $x \otimes y= 1_{_{G \otimes G}}$ in the nonabelian tensor square $G \otimes G$ of $G$. This number, divided by $|G|^2$, is called the tensor degree of $G$ and has connection with the exterior degree, introduced few years ago in [P. Niroomand and R. Rezaei, On the exterior degree of finite groups, Comm. Algebra 39 (2011), 335--343]. The analysis of upper and lower bounds of the tensor degree allows us to find interesting structural restrictions for the whole group.

algebraic topologyFOS: MathematicsAlgebraic Topology (math.AT)Mathematics - CombinatoricsGroup Theory (math.GR)Combinatorics (math.CO)Mathematics - Algebraic TopologySettore MAT/03 - Geometria20D15 20J99 20D60 20C25Nonabelian tensor squareprobability of commuting pairsMathematics - Group Theory$p$-goup
researchProduct

Una política juvenil para promover el desarrollo local: un estudio de caso

2019

El artículo presenta un estudio de caso de una política juvenil realizada en la última década en una región del Sur de Italia. Su interés reside en la versatilidad, el enfoque multidimensional y en el hecho de haber actuado como un óptimo instrumento de desarrollo local. El estudio de caso se ha realizado a través del análisis documental de las evaluaciones ex -ante, durante y ex – post que se hicieron para valorar el impacto de la política. La reflexión que el caso propone se enfoca en cómo se puede promover eficazmente el desarrollo local a través de políticas más trasversales.

américa latinainnovaciónitaliaTreball social amb els jovesjóvenesdesarrollo localWelfare economicsLocal DevelopmentHT101-395Cities. Urban geographyUrban groups. The city. Urban sociologyAction (philosophy)comunidadTransversal (combinatorics)Political sciencePolicy implementationGF125Reflection (computer graphics)Economía Sociedad y Territorio
researchProduct

On the Influence of Grammars on Crossover in Grammatical Evolution

2021

Standard grammatical evolution (GE) uses a one-point crossover (“ripple crossover”) that exchanges codons between two genotypes. The two resulting genotypes are then mapped to their respective phenotypes using a Backus-Naur form grammar. This article studies how different types of grammars affect the resulting individuals of a ripple crossover. We distinguish different grammars based on the expected number of non-terminals chosen when mapping genotype codons to phenotypes, \(B_{avg}\). The grammars only differ in \(B_{avg}\) but can express the same phenotypes. We perform crossover operations on the genotypes and find that grammars with \(B_{avg} > 1\) lead to high numbers of either very sm…

animal structuresGrammarComputer sciencemedia_common.quotation_subjecteducationCrossover0102 computer and information sciences02 engineering and technologyExpected value01 natural sciencesCombinatoricsRule-based machine translation010201 computation theory & mathematicsGrammatical evolution0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingmedia_common
researchProduct

On the suffix automaton with mismatches

2007

International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.

approximate string matchingFibonacci numberlanguages with mismatches[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Generalized suffix treeBüchi automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technology01 natural sciencesCombinatoricsPrefixCombinatorics on wordsDeterministic finite automaton010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringSuffix automaton020201 artificial intelligence & image processingsuffix automatacombinatorics on wordsComputer Science::Data Structures and Algorithmscombinatorics on words suffix automata languages with mismatches approximate string matchingWord (computer architecture)Computer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Optimal recovery of a radiating source with multiple frequencies along one line

2020

We study an inverse problem where an unknown radiating source is observed with collimated detectors along a single line and the medium has a known attenuation. The research is motivated by applications in SPECT and beam hardening. If measurements are carried out with frequencies ranging in an open set, we show that the source density is uniquely determined by these measurements up to averaging over levelsets of the integrated attenuation. This leads to a generalized Laplace transform. We also discuss some numerical approaches and demonstrate the results with several examples.

attenuated Radon transformMultispectralRAYUniqueness theorem01 natural sciencesinversio-ongelmat44A10 (Primary) 65R32 44A60 46N40 65Z05 (Secondary)030218 nuclear medicine & medical imaging0302 clinical medicine111 MathematicsDiscrete Mathematics and CombinatoricstietokonetomografiaPharmacology (medical)INVERSIONnuclear medicineBeam hardeningPhysicsLaplace transformDetectorNumerical Analysis (math.NA)Inverse problemuniqueness theoremFunctional Analysis (math.FA)Mathematics - Functional AnalysisMultiplicative system theoremkuvantaminensovellettu matematiikkaModeling and SimulationSPECTLine (geometry)numeerinen analyysipositroniemissiotomografiaemission computed tomographyAttenuated Radon transformEmission computed tomographyControl and OptimizationLaplace transformmultispectralOpen setCollimated light03 medical and health sciencesnuclear medicine.multiplicative system theoremFOS: Mathematicsinverse source problemMathematics - Numerical Analysis0101 mathematicsAttenuation010102 general mathematicsInverse source problemRangingComputational physicsTENSOR TOMOGRAPHYPETbeam hardeningNuclear MedicineAnalysis
researchProduct

The b-chromatic number of power graphs

2003

The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x_i adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.

b-chromatic numberGeneral Computer Science[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]power graphTheoretical Computer ScienceCombinatoricsComputer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsChromatic scaleGraph coloringcoloringMathematicscycle and complete binary treeMathematics::CombinatoricsBinary treelcsh:Mathematicscycle and complete binary tree.path[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Complete coloringlcsh:QA1-939Vertex (geometry)Brooks' theorem[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Edge coloringFractional coloringDiscrete Mathematics & Theoretical Computer Science
researchProduct

A simulation function approach for best proximity point and variational inequality problems

2017

We study sufficient conditions for existence of solutions to the global optimization problem min(x is an element of A) d(x, fx), where A, B are nonempty subsets of a metric space (X, d) and f : A -> B belongs to the class of proximal simulative contraction mappings. Our results unify, improve and generalize various comparable results in the existing literature on this topic. As an application of the obtained theorems, we give some solvability theorems of a variational inequality problem.

best proximity point fixed point simulation functions variational inequality problemsNumerical AnalysisControl and OptimizationAlgebra and Number Theory010102 general mathematicsMathematical analysisFunction (mathematics)01 natural sciences010101 applied mathematicsSettore MAT/05 - Analisi MatematicaVariational inequalityProximity problemsDiscrete Mathematics and CombinatoricsApplied mathematicsPoint (geometry)0101 mathematicsAnalysisMathematicsMiskolc Mathematical Notes
researchProduct

Normal, Abby Normal, Prefix Normal

2014

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number \(\textit{pnw}(n)\) of prefix normal words of length n, showing that \(\textit{pnw}(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)\) for some c and \(\textit{pnw}(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)\). We introduce efficient algorithms for testing the prefix normal property and a “mechanical algorithm” for computing prefix normal forms. We also include games which can be played with prefix normal words. In these games Alice wishes t…

binary jumbled pattern matchingEfficient algorithmmembership testBinary numberContext (language use)Prefix Normal Word AlgorithmData_CODINGANDINFORMATIONTHEORYprefix normal wordsOmegaSubstringenumerationCombinatoricsPrefixprefix normal words; binary jumbled pattern matching; normal forms; enumeration; membership test; binary languagesEnumerationnormal formsbinary languagesWord (group theory)Mathematics
researchProduct

Skinning Measures with Potential on CAT(–1) Spaces

2019

In this chapter, we introduce skinning measures as weighted pushforwards of the Patterson{Sullivan densities associated with a potential to the unit normal bundles of convex subsets of a CAT(–1) space.

body regionsCombinatoricsSkinningRegular polygonSpace (mathematics)Unit (ring theory)Mathematics
researchProduct