Search results for "Fibonacci number"

showing 9 items of 29 documents

A programming guide for tensor networks with global SU(2) symmetry

2020

Abstract This paper is a manual with tips and tricks for programming tensor network algorithms with global S U ( 2 ) symmetry. We focus on practical details that are many times overlooked when it comes to implementing the basic building blocks of codes, such as useful data structures to store the tensors, practical ways of manipulating them, and adapting typical functions for symmetric tensors. Here we do not restrict ourselves to any specific tensor network method, but keep always in mind that the implementation should scale well for simulations of higher-dimensional systems using, e.g., Projected Entangled Pair States, where tensors with many indices may show up. To this end, the structur…

PhysicsFibonacci number010308 nuclear & particles physicsAlgebraic specificationGeneral Physics and AstronomyData structure01 natural sciencesTopological quantum computerAlgebraFusion tree0103 physical sciencesSymmetric tensorTensorSymmetry (geometry)010306 general physicsAnnals of Physics
researchProduct

m-bonacci metamaterial multilayers: location of the zero-average index bandgap edges

2009

We examine quasiperiodic multilayers arranged in m-bonacci sequences, which combine ordinary positiveindex materials and dispersive metamaterials with negative index in a certain frequency range. When the volume-averaged refractive index of the nonperiodic multilayer equals zero, the structure does not propagate light radiation and exhibits a forbidden band. We identify some analytical expressions to determine the upper and lower limits of the above zero-average refractive-index bandgap. We recognize that these limits are not explicitly dependent on the geometrical parameters of the stack of layers. © 2009 Optical Society of America. Fil: Monsoriu, J.A.. Universidad Politécnica de Valencia;…

PhysicsFibonacci numberbusiness.industryBand gapCiencias FísicasPHOTONIC CRYSTALSPhysics::OpticsMetamaterialFIBONACCIAtomic and Molecular Physics and OpticsNEGATIVE INDEXAstronomíaOpticsStack (abstract data type)METAMATERIALSQuasiperiodic functionReflection coefficientbusinessRefractive indexCIENCIAS NATURALES Y EXACTASPhotonic crystal
researchProduct

Diffractive m-bonacci lenses.

2017

[EN] Fibonacci zone plates are proving to be promising candidates in image forming devices. In this letter we show that the set of Fibonacci zone plates are a particular member of a new family of diffractive lenses which can be designed on the basis of a given m-bonacci sequence. These lenses produce twin axial foci whose separation depends on the m-golden mean. Therefore, with this generalization, bifocal systems can be freely designed under the requirement at particular focal planes. Experimental results support our proposal. (C) 2017 Optical Society of America

PhysicsSequenceFresnel zoneFibonacci numberBasis (linear algebra)Generalizationbusiness.industry02 engineering and technology021001 nanoscience & nanotechnology01 natural sciencesAtomic and Molecular Physics and OpticsImage (mathematics)010309 opticsSet (abstract data type)Diffractive lensOpticsFISICA APLICADA0103 physical sciences0210 nano-technologybusinessOptics express
researchProduct

Binary Patterns in Infinite Binary Words

2002

In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w) of factors of the word. Since the set P(w) can be considered as an extension of the set F(w), we first investigate how large is such extension, by introducing the parameter ?(w) that corresponds to the cardinality of the difference set P(w) \ F(w). Some non trivial results about such parameter are obtained in the case of the Thue-Morse and the Fibonacci words. Since, in most cases, the parameter ?(w) is infinite, we introduce the pattern complexity of w, which corresponds to the complexity of the language P(w). As a main result, we prove that there exist infini…

Set (abstract data type)Discrete mathematicsFibonacci numberDifference setCardinalityBinary numberBinary systemExtension (predicate logic)ArithmeticWord (group theory)Mathematics
researchProduct

Topological Minimally Entangled States via Geometric Measure

2014

Here we show how the Minimally Entangled States (MES) of a 2d system with topological order can be identified using the geometric measure of entanglement. We show this by minimizing this measure for the doubled semion, doubled Fibonacci and toric code models on a torus with non-trivial topological partitions. Our calculations are done either quasi-exactly for small system sizes, or using the tensor network approach in [R. Orus, T.-C. Wei, O. Buerschaper, A. Garcia-Saez, arXiv:1406.0585] for large sizes. As a byproduct of our methods, we see that the minimisation of the geometric entanglement can also determine the number of Abelian quasiparticle excitations in a given model. The results in …

Statistics and ProbabilityPhysicsQuantum PhysicsFibonacci numberToric codeStrongly Correlated Electrons (cond-mat.str-el)High Energy Physics - Lattice (hep-lat)FOS: Physical sciencesStatistical and Nonlinear PhysicsTorusQuantum entanglementTopologyMultipartite entanglementCondensed Matter - Strongly Correlated ElectronsHigh Energy Physics - LatticeTopological orderStatistics Probability and UncertaintyAbelian groupQuantum Physics (quant-ph)Quantum
researchProduct

Surfaces of minimal degree of tame representation type and mutations of Cohen–Macaulay modules

2017

We provide two examples of smooth projective surfaces of tame CM type, by showing that any parameter space of isomorphism classes of indecomposable ACM bundles with fixed rank and determinant on a rational quartic scroll in projective 5-space is either a single point or a projective line. For surfaces of minimal degree and wild CM type, we classify rigid Ulrich bundles as Fibonacci extensions. For the rational normal scrolls S(2,3) and S(3,3), a complete classification of rigid ACM bundles is given in terms of the action of the braid group in three strands.

[ MATH ] Mathematics [math]Pure mathematicsFibonacci numberGeneral MathematicsType (model theory)Rank (differential topology)Commutative Algebra (math.AC)01 natural sciencesMathematics - Algebraic GeometryACM bundlesVarieties of minimal degreeMathematics::Algebraic Geometry0103 physical sciencesFOS: MathematicsMathematics (all)Rings0101 mathematics[MATH]Mathematics [math]Algebraic Geometry (math.AG)MathematicsDiscrete mathematics14F05 13C14 14J60 16G60010102 general mathematicsVarietiesMCM modulesACM bundles; MCM modules; Tame CM type; Ulrich bundles; Varieties of minimal degree; Mathematics (all)Ulrich bundlesMathematics - Commutative AlgebraQuintic functionElliptic curveTame CM typeProjective lineBundles010307 mathematical physicsIsomorphismIndecomposable moduleMSC: 14F05; 13C14; 14J60; 16G60
researchProduct

Equivalence classes of permutations modulo excedances

2014

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]Discrete mathematicsCombinatoricsFibonacci numberModulo[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]Equivalence classComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Gray code for compositions of n with parts 1 and p

2009

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]permutation avoiding pattern[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Fibonacci numbercomposition of an integerGray codeComputingMilieux_MISCELLANEOUS
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