Search results for " Order"

showing 10 items of 827 documents

Branches of index-preserving solutions to systems of second order ODEs

2009

We investigate the existence of a continuum of index-preserving solutions to a Dirichlet problem associated with a parameter-dependent system of second order ordinary differential equations, developing a detailed analysis on the behaviour of the branches of nontrivial solutions. Our approach is based on the Rabinowitz global bifurcation Theorem combined with the notion of index and nullity of suitable linear boundary value problems. An application of the result to the study of branches of odd, periodic solutions for suitable systems of two linearly coupled pendulums of lenghts variables is also analyzed.

Dirichlet problemContinuum (topology)Applied MathematicsMathematical analysisOdesymbols.namesakeDirichlet boundary conditionOrdinary differential equationsymbolsOrder (group theory)Second order systems Index-preserving solutions BifurcationBoundary value problemAnalysisBifurcationMathematics
researchProduct

IMPLICIT MESH DISCONTINUOUS GALERKIN FOR VARIABLE ANGLE TOW MULTILAYERED PLATES

2018

This works presents a novel computational scheme for variable angle tow (VAT) multilayered plates [1]. The characteristic features of the proposed scheme are the combined use of a discontinuous Galerkin (dG) formulation and an implicitly defined mesh. The formulation is based on the principle of virtual displacements (PVD) and the Equivalent Single Layer (ESL) assumption for the mechanical behavior of the VAT plates [2]. The problem is first placed within the dG framework by suitably introducing an auxiliary variable and by rewriting the set of equations governing ESL VAT plates as a firstorder system of differential equations. Following Arnold et al.[3] and by introducing suitably defined …

Discontinuous Galerkin methods Variable angle tow composites multi-layered plates higher order theoriesSettore ING-IND/04 - Costruzioni E Strutture Aerospaziali
researchProduct

On the loopless generation of binary tree sequences

1998

Weight sequences were introduced by Pallo in 1986 for coding binary trees and he presented a constant amortized time algorithm for their generation in lexicographic order. A year later, Roelants van Baronaigien and Ruskey developed a recursive constant amortized time algorithm for generating Gray code for binary trees in Pallo's representation. It is common practice to find a loopless generating algorithm for a combinatorial object when enunciating a Gray code for this object. In this paper we regard weight sequences as variations and apply a Williamson algorithm in order to obtain a loopless generating algorithm for the Roelants van Baronaigien and Ruskey's Gray code for weight sequences.

Discrete mathematicsAmortized analysisBinary treeLexicographical orderPseudorandom binary sequenceComputer Science ApplicationsTheoretical Computer ScienceGray codeCombinatoricsSignal ProcessingBinary codeInformation SystemsCoding (social sciences)MathematicsInformation Processing Letters
researchProduct

A bijection between words and multisets of necklaces

2012

Two of the present authors have given in 1993 a bijection Phi between words on a totally ordered alphabet and multisets of primitive necklaces. At the same time and independently, Burrows and Wheeler gave a data compression algorithm which turns out to be a particular case of the inverse of Phi. In the present article, we show that if one replaces in Phi the standard permutation of a word by the co-standard one (reading the word from right to left), then the inverse bijection is computed using the alternate lexicographic order (which is the order of real numbers given by continued fractions) on necklaces, instead of the lexicographic order as for Phi(-1). The image of the new bijection, ins…

Discrete mathematicsBurrows and Wheeler TransformMathematics::CombinatoricsSettore INF/01 - InformaticaFree Lie algebraLie superalgebrastandard permutationLexicographical orderTheoretical Computer ScienceImage (mathematics)CombinatoricsSet (abstract data type)PermutationComputational Theory and MathematicsBijectionDiscrete Mathematics and CombinatoricsGeometry and TopologyComputer Science::Formal Languages and Automata TheoryWord (group theory)MathematicsReal number
researchProduct

The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group

2001

We consider order-generic queries, i.e., queries which commute with every order-preserving automorphism of a structure's universe. It is well-known that first-order logic has the natural order-generic collapse over the rational and the real ordered group for the class of dense order constraint databases (also known as finitely representable databases). I.e., on this class of databases over 〈Q, <〉 or 〈R, <〉, addition does not add to the expressive power of first-order logic for defining order-generic queries. In the present paper we develop a natural generalization of the notion of finitely representable databases, where an arbitrary (i.e. possibly infinite) number of regions is allowed. We …

Discrete mathematicsClass (set theory)Logic in computer scienceDatabaseGroup (mathematics)Structure (category theory)computer.software_genreAutomorphismCombinatoricsDense orderDatabase theorycomputerComputer Science::DatabasesMathematicsUniverse (mathematics)
researchProduct

Precise bounds for the sequential order of products of some Fréchet topologies

1998

Abstract The sequential order of a topological space is the least ordinal for which the corresponding iteration of the sequential closure is idempotent. Lower estimates for the sequential order of the product of two regular Frechet topologies and upper estimates for the sequential order of the product of two subtransverse topologies are given in terms of their fascicularity and sagittality. It is shown that for every countable ordinal α, there exists a Lasnev topology such that the sequential order of its square is equal to α.

Discrete mathematicsClosure (topology)Topological spaceSequential spaceSquare (algebra)CombinatoricsProduct (mathematics)IdempotenceOrder (group theory)Countable setGeometry and TopologySequential orderFréchet (Fréchet-Urysohn) topologyProductMathematicsTopology and its Applications
researchProduct

Produktintegration mit nicht-�quidistanten St�tzstellen

1980

For the numerical evaluation of $$\int\limits_a^b {(t - a)^{\alpha - 1} x(t)dt}$$ , 0<?<1 andx `smooth', product integration rules are applied. It is known that high-order rules, e.g. Gauss-Legendre quadrature, become `normal'-order rules in this case. In this paper it is shown that the high order is preserved by a nonequidistant spacing. Furthermore, the leading error terms of this product integration method and numerical examples are given.

Discrete mathematicsComputational MathematicsApplied MathematicsNumerical analysisProduct integrationHigh orderAlgorithmQuadrature (mathematics)MathematicsNumerische Mathematik
researchProduct

First-order expressibility of languages with neutral letters or: The Crane Beach conjecture

2005

A language L over an alphabet A is said to have a neutral letter if there is a letter [email protected]?A such that inserting or deleting e's from any word in A^* does not change its membership or non-membership in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates apart from the order predicate useless, i.e., that if a language L with a neutral letter is not definable in first-order logic with linear order, then it is not definable in first-order logic with any set N of numerical predicates. Named after the location of its first, flawed, proof this conjecture is called the Crane Beach …

Discrete mathematicsConjectureComputer Networks and CommunicationsApplied MathematicsFirst orderNumerical predicatesPredicate (grammar)Theoretical Computer ScienceFirst-order logicIterated logarithmCombinatoricsComputational Theory and MathematicsRegular languageDatabase theoryCircuit complexityFirst-order logicCircuit uniformityMathematicsJournal of Computer and System Sciences
researchProduct

Topological invariants of stable immersions of oriented 3-manifolds in R4

2012

Abstract We show that the Z -module of first order local Vassiliev type invariants of stable immersions of oriented 3-manifolds into R 4 is generated by 3 topological invariants: The number of pairs of quadruple points and the positive and negative linking invariants l + and l − introduced by V. Goryunov (1997) [7] . We obtain the expression for the Euler characteristic of the immersed 3-manifold in terms of these invariants. We also prove that the total number of connected components of the triple points curve is a non-local Vassiliev type invariant.

Discrete mathematicsConnected componentPure mathematicsFirst order local Vassiliev type invariantsFirst ordersymbols.namesakeEuler characteristicsymbolsTopological invariantsGeometry and TopologyInvariant (mathematics)Stable immersionsSINGULARIDADESMathematicsTopology and its Applications
researchProduct

Coupled fixed point, F-invariant set and fixed point of N-order

2010

‎In this paper‎, ‎we establish some new coupled fixed point theorems in complete metric spaces‎, ‎using a new concept of $F$-invariant set‎. ‎We introduce the notion of fixed point of $N$-order as natural extension of that of coupled fixed point‎. ‎As applications‎, ‎we discuss and adapt the presented results to the setting of partially ordered cone metric spaces‎. ‎The presented results extend and complement some known existence results from the literature‎.

Discrete mathematicsCoupled fixed point F-invariant set fixed point of N-order partially ordered set cone metric spaceControl and OptimizationAlgebra and Number Theory47H10‎Fixed-point theoremFixed pointFixed-point propertyCoupled fixed point‎partially ordered setLeast fixed point‎$F$-invariant set54H25Schauder fixed point theoremFixed-point iterationSettore MAT/05 - Analisi Matematica‎34B15‎cone metric space‎fixed point of $N$-orderKakutani fixed-point theoremAnalysisHyperbolic equilibrium pointMathematics
researchProduct