Search results for "Polygon"

showing 10 items of 282 documents

Extremal solutions and strong relaxation for nonlinear multivalued systems with maximal monotone terms

2018

Abstract We consider differential systems in R N driven by a nonlinear nonhomogeneous second order differential operator, a maximal monotone term and a multivalued perturbation F ( t , u , u ′ ) . For periodic systems we prove the existence of extremal trajectories, that is solutions of the system in which F ( t , u , u ′ ) is replaced by ext F ( t , u , u ′ ) (= the extreme points of F ( t , u , u ′ ) ). For Dirichlet systems we show that the extremal trajectories approximate the solutions of the “convex” problem in the C 1 ( T , R N ) -norm (strong relaxation).

Differential inclusionPure mathematicsApplied Mathematics010102 general mathematicsRegular polygonMaximal monotone mapAnalysiPerturbation (astronomy)Bang-bang controlExtremal trajectorieDifferential operator01 natural sciencesDirichlet distribution010101 applied mathematicsNonlinear systemsymbols.namesakeMonotone polygonSettore MAT/05 - Analisi MatematicaNorm (mathematics)symbols0101 mathematicsExtreme pointStrong relaxationAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Shape optimization for monge-ampére equations via domain derivative

2011

In this note we prove that, if $\Omega$ is a smooth, strictly convex, open set in $R^n$ $(n \ge 2)$ with given measure, the $L^1$ norm of the convex solution to the Dirichlet problem $\det D^2 u=1$ in $\Omega$, $u=0$ on $\partial\Omega$, is minimum whenever $\Omega$ is an ellipsoid.

Dirichlet problemMathematical optimizationPure mathematicsFictitious domain methodDomain derivativeApplied MathematicsOpen setRegular polygonMonge–Ampère equationMonge-Ampère equationSettore MAT/05 - Analisi MatematicaGeneralizations of the derivativeNorm (mathematics)Discrete Mathematics and CombinatoricsAffine isoperimetric inequalitiesConvex functionAnalysisMathematics
researchProduct

Radial solutions of Dirichlet problems with concave-convex nonlinearities

2011

Abstract We prove the existence of a double infinite sequence of radial solutions for a Dirichlet concave–convex problem associated with an elliptic equation in a ball of R n . We are interested in relaxing the classical positivity condition on the weights, by allowing the weights to vanish. The idea is to develop a topological method and to use the concept of rotation number. The solutions are characterized by their nodal properties.

Dirichlet problemNon lineariteApplied MathematicsMathematical analysisRegular polygonRadial solutions Multiplicity results Dirichlet concave–convex problem Rotation numberDirichlet distributionElliptic curveNonlinear systemsymbols.namesakesymbolsBall (mathematics)AnalysisRotation numberMathematics
researchProduct

Multiple solutions with sign information for a (p,2)-equation with combined nonlinearities

2020

Abstract We consider a parametric nonlinear Dirichlet problem driven by the sum of a p -Laplacian and of a Laplacian (a ( p , 2 ) -equation) and with a reaction which has the competing effects of two distinct nonlinearities. A parametric term which is ( p − 1 ) -superlinear (convex term) and a perturbation which is ( p − 1 ) -sublinear (concave term). First we show that for all small values of the parameter the problem has at least five nontrivial smooth solutions, all with sign information. Then by strengthening the regularity of the two nonlinearities we produce two more nodal solutions, for a total of seven nontrivial smooth solutions all with sign informations. Our proofs use critical p…

Dirichlet problemNonlinear systemSublinear functionApplied MathematicsMathematical analysisRegular polygonPerturbation (astronomy)Laplace operatorAnalysisMathematicsParametric statisticsNonlinear Analysis
researchProduct

An Efficient Algorithm for the Generation of Z-Convex Polyominoes

2014

We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.

Discrete mathematicsAmortized analysisMathematics::CombinatoricsSettore INF/01 - InformaticaPolyominoEfficient algorithmRegular polygonComputer Science::Computational GeometryCharacterization (mathematics)CombinatoricsIntegerComputer Science::Discrete MathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYConstant (mathematics)TetrominoZ-convex polyominoes generation.Mathematics
researchProduct

Measure-free conditioning and extensions of additive measures on finite MV-algebras

2010

Using the well known representation of any finite MV-algebra as a product of finite MV-chains as factors, we obtain a representation of its canonical extension as a Girard algebra product of the canonical extensions of the MV-chain factors. Based on this representation and using the results from our last paper, we characterize the additive measures on any finite MV-algebra resp. the weakly and the strongly additive measures on its canonical Girard algebra extension, and that as convex combinations of the corresponding measures on the respective factors. After that we apply the results to measure-free defined conditional events which for this reason are considered as elements of the canonica…

Discrete mathematicsArtificial IntelligenceLogicLattice (order)Additive functionFuzzy setRegular polygonInformation processingConditional probabilityProbability distributionFuzzy control systemMathematicsFuzzy Sets and Systems
researchProduct

Combinatorial aspects of L-convex polyominoes

2007

We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …

Discrete mathematicsClass (set theory)Mathematics::CombinatoricsPolyominoEnumerationOpen problemGenerating functionRegular polygonPolyominoesNatural numberComputer Science::Computational GeometryFormal SeriesCombinatoricsCardinalityRegular languageDiscrete Mathematics and CombinatoricsTomographyAlgorithmsbinary tomographyMathematicsEnumeration; Formal Series; PolyominoesEuropean Journal of Combinatorics
researchProduct

On positive P

2002

Continuing a line of research opened up by Grigni and Sipser (1992) and further pursued by Stewart (1994), we show that a wide variety of equivalent characterizations of P still remain equivalent when restricted to be positive. All these restrictions thus define the same class posP, a proper subclass of monP, the class of monotone problems in P. We also exhibit complete problems for posP under very weak reductions.

Discrete mathematicsCombinatoricsClass (set theory)Monotone polygonBoolean circuitComplexity classVariety (universal algebra)Boolean functionTime complexitySubclassMathematicsProceedings of Computational Complexity (Formerly Structure in Complexity Theory)
researchProduct

Mixed intersections of non quasi-analytic classes

2008

Given two semi-regular matrices M and M' and two open subsets O and O' [resp. two compact subsets K and K'] of Rr and Rs respectively, we introduce the spaces E(M×M')(O × O') and D(M×M')(O × O') [resp. D(M×M')(K × K')]. In this paper we study their locally convex properties and the structure of their elements. This leads in [10] to tensor product representations of these spaces and to some kernel theorems.

Discrete mathematicsCombinatoricsComputational MathematicsAlgebra and Number TheoryTensor productKernel (set theory)Applied MathematicsStructure (category theory)Regular polygonGeometry and TopologyAnalysisMathematicsRevista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
researchProduct

Vector-valued meromorphic functions

2002

A locally complete locally convex space E satisfies that every weakly meromorphic function defined on an open subset of \( \mathbb{C} \) with values in E is meromorphic if and only if E does not contain a countable product of copies of \( \mathbb{C} \). A characterization of locally complete spaces in the spirit of known characterizations of the (metric) convex compactness property is also given.

Discrete mathematicsCompact spaceGeneral MathematicsProduct (mathematics)Regular polygonConvex setCountable setCharacterization (mathematics)Complete metric spaceMeromorphic functionMathematics
researchProduct