Search results for "Integer"

showing 10 items of 250 documents

Multiple positive solutions of some elliptic problems via the Morse theory and the domain topology

1994

We use Morse theory to estimate the number of positive solutions of an elliptic problem in an open bounded setΩ ∉ ℝN. The number of solutions depends on the topology ofΩ, actually onP t (Ω), the Poincare polynomial ofΩ. More precisely, we obtain the following Morse relations: $$\sum\limits_{u \in K} {t^{\mu \left( u \right)} } = tP_t \left( \Omega \right) + t^2 [P_t \left( \Omega \right) - 1] + t\left( {1 + t} \right)\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{O} \left( t \right)$$ , where $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{O} \left( t \right)$$ is a polynomial with non-negative integer coefficients,K is the set of positive solutions …

Polynomial (hyperelastic model)IntegerApplied MathematicsBounded functionDomain (ring theory)TopologyOmegaAnalysisMorse theoryMathematicsCalculus of Variations and Partial Differential Equations
researchProduct

Symbolic Worst Case Execution Times

2011

In immediate or hard real-time systems the correctness of an operation depends not only upon its logical correctness, but also on the time in which it is computed. In such systems, it is imperative that operations are performed within a given deadline because missing this deadline constitutes the failure of the complete system. Such systems include medical systems, flight control systems and other systems whose failure in responding punctually results in a high economical loss or even in the loss of human lives. These systems are usually analyzed in a sequence of steps in which first, a socalled control flow graph (CFG) is constructed that represents possible program flows. Furthermore, bou…

PolynomialSequenceCorrectnessWorst-case execution timeComputer scienceCode (cryptography)Control flow graphInteger programmingAlgorithmLongest path problem
researchProduct

Some Decision Results on Nonrepetitive Words

1985

The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.

PrefixCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Discrete MathematicsUnique factorization domainComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Square-free integerComputer Science::Formal Languages and Automata TheoryBinary alphabetWord (computer architecture)Mathematics
researchProduct

Irreducible characters of $3'$-degree of finite symmetric, general linear and unitary groups

2018

Abstract Let G be a finite symmetric, general linear, or general unitary group defined over a field of characteristic coprime to 3. We construct a canonical correspondence between irreducible characters of degree coprime to 3 of G and those of N G ( P ) , where P is a Sylow 3-subgroup of G . Since our bijections commute with the action of the absolute Galois group over the rationals, we conclude that fields of values of character correspondents are the same.

Pure mathematicsAlgebra and Number TheoryCoprime integers010102 general mathematicsCharacter theorySylow theoremsField (mathematics)0102 computer and information sciencesAbsolute Galois group16. Peace & justice01 natural sciencesRepresentation theoryMathematics::Group TheoryCharacter (mathematics)010201 computation theory & mathematicsUnitary groupFOS: Mathematics0101 mathematicsRepresentation Theory (math.RT)Mathematics - Representation TheoryMathematics
researchProduct

Degree-problems I squarefree character degrees

1985

Pure mathematicsCharacter (mathematics)Degree (graph theory)General MathematicsSquare-free integerMathematicsArchiv der Mathematik
researchProduct

Coprime action, characters and decomposition numbers

1996

Pure mathematicsCoprime integersAction (philosophy)General MathematicsDecomposition (computer science)MathematicsArchiv der Mathematik
researchProduct

Coprime actions and degrees of primitive inducers of invariant characters

2001

Let a finite group A act coprimely on a finite group G and χ ∈ Irr A(G). Isaacs, Lewis and Navarro proved that if G is nilpotent then the degrees of any two A-primitive characters of A-invariant subgroups of G inducing χ coincide. In this note we aim at extending this result by weakening the hypothesis on G.

Pure mathematicsCoprime integersGeneral MathematicsInvariant (mathematics)MathematicsBulletin of the Australian Mathematical Society
researchProduct

Projective Crystalline Representations of \'Etale Fundamental Groups and Twisted Periodic Higgs-de Rham Flow

2017

This paper contains three new results. {\bf 1}.We introduce new notions of projective crystalline representations and twisted periodic Higgs-de Rham flows. These new notions generalize crystalline representations of \'etale fundamental groups introduced in [7,10] and periodic Higgs-de Rham flows introduced in [19]. We establish an equivalence between the categories of projective crystalline representations and twisted periodic Higgs-de Rham flows via the category of twisted Fontaine-Faltings module which is also introduced in this paper. {\bf 2.}We study the base change of these objects over very ramified valuation rings and show that a stable periodic Higgs bundle gives rise to a geometric…

Pure mathematicsDegree (graph theory)Coprime integersMathematics - Number TheoryAbsolutely irreducibleApplied MathematicsGeneral MathematicsImage (category theory)Order (ring theory)Higgs bundleHiggs fieldMathematics - Algebraic Geometryp-adic Hodge theoryMathematics
researchProduct

A Tomographical Characterization of L-convex Polyominoes

2005

Our main purpose is to characterize the class of L-convex polyominoes introduced in [3] by means of their horizontal and vertical projections. The achieved results allow an answer to one of the most relevant questions in tomography i.e. the uniqueness of discrete sets, with respect to their horizontal and vertical projections. In this paper, by giving a characterization of L-convex polyominoes, we investigate the connection between uniqueness property and unimodality of vectors of horizontal and vertical projections. In the last section we consider the continuum environment; we extend the definition of L-convex set, and we obtain some results analogous to those for the discrete case.

Pure mathematicsInteger VectorHorizontal and verticalPolyominoDiscrete TomographyConvex setDiscrete geometryUnimodalityConnection (mathematics)Vertical ProjectionContinuum CounterpartMonotone PathUniquenessDiscrete tomographyMathematics
researchProduct

On the representation of integers by indefinite binary Hermitian forms

2011

Given an integral indefinite binary Hermitian form f over an imaginary quadratic number field, we give a precise asymptotic equivalent to the number of nonequivalent representations, satisfying some congruence properties, of the rational integers with absolute value at most s by f, as s tends to infinity.

Pure mathematicsrepresentation of integersGeneral MathematicsHyperbolic geometryAMS : 11E39 11N45 20H10 30F4001 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]symbols.namesake0103 physical sciencesEisenstein seriesCongruence (manifolds)group of automorphs0101 mathematicsQuaternionMathematicsBinary Hermitian formQuaternion algebraMathematics - Number TheorySesquilinear formta111010102 general mathematicsOrder (ring theory)Hermitian matrix[MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]Bianchi group[MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG]symbolsMathematics::Differential Geometry010307 mathematical physics
researchProduct