Search results for "Polygon"

showing 10 items of 282 documents

Relaxation for a Class of Control Systems with Unilateral Constraints

2019

We consider a nonlinear control system involving a maximal monotone map and with a priori feedback. We assume that the control constraint multifunction $U(t,x)$ is nonconvex valued and only lsc in the $x \in \mathbb{R}^{N}$ variable. Using the Q-regularization (in the sense of Cesari) of $U(t,\cdot )$, we introduce a relaxed system. We show that this relaxation process is admissible.

Class (set theory)Partial differential equationApplied Mathematics010102 general mathematicsMaximal monotone mapNonlinear control01 natural sciencesAdmissible relaxation010101 applied mathematicsConstraint (information theory)CombinatoricsMonotone polygonQ-regularizationSettore MAT/05 - Analisi MatematicaControl systemRelaxation (approximation)0101 mathematicsLower semicontinuous multifunctionVariable (mathematics)MathematicsContinuous selection
researchProduct

Classification and non-existence results for weak solutions to quasilinear elliptic equations with Neumann or Robin boundary conditions

2021

Abstract We classify positive solutions to a class of quasilinear equations with Neumann or Robin boundary conditions in convex domains. Our main tool is an integral formula involving the trace of some relevant quantities for the problem. Under a suitable condition on the nonlinearity, a relevant consequence of our results is that we can extend to weak solutions a celebrated result obtained for stable solutions by Casten and Holland and by Matano.

Class (set theory)Trace (linear algebra)010102 general mathematicsRegular polygon01 natural sciencesRobin boundary conditionNon-existenceNonlinear systemClassification of solutionsMathematics - Analysis of PDEsSettore MAT/05 - Analisi Matematica0103 physical sciencesQuasilinear anisotropic elliptic equationsFOS: MathematicsLiouville-type theoremApplied mathematics010307 mathematical physicsIntegral formula0101 mathematicsAnalysisMathematicsAnalysis of PDEs (math.AP)
researchProduct

Deuring’s mass formula of a Mumford family

2015

We study the Newton polygon jumping locus of a Mumford family in char p p . Our main result says that, under a mild assumption on p p , the jumping locus consists of only supersingular points and its cardinality is equal to ( p r − 1 ) ( g − 1 ) (p^r-1)(g-1) , where r r is the degree of the defining field of the base curve of a Mumford family in char p p and g g is the genus of the curve. The underlying technique is the p p -adic Hodge theory.

CombinatoricsCardinalityDegree (graph theory)Applied MathematicsGeneral MathematicsHodge theoryGenus (mathematics)Field (mathematics)Newton polygonLocus (mathematics)Base (topology)MathematicsTransactions of the American Mathematical Society
researchProduct

The simplex dispersion ordering and its application to the evaluation of human corneal endothelia

2009

A multivariate dispersion ordering based on random simplices is proposed in this paper. Given a R^d-valued random vector, we consider two random simplices determined by the convex hulls of two independent random samples of sizes d+1 of the vector. By means of the stochastic comparison of the Hausdorff distances between such simplices, a multivariate dispersion ordering is introduced. Main properties of the new ordering are studied. Relationships with other dispersion orderings are considered, placing emphasis on the univariate version. Some statistical tests for the new order are proposed. An application of such ordering to the clinical evaluation of human corneal endothelia is provided. Di…

CombinatoricsConvex hullStatistics and ProbabilityNumerical AnalysisHausdorff distanceSimplexMultivariate random variableHausdorff spaceRegular polygonUnivariateStatistical dispersionStatistics Probability and UncertaintyMathematicsJournal of Multivariate Analysis
researchProduct

A reconstruction algorithm for L-convex polyominoes

2006

AbstractWe give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.

CombinatoricsConvexityMathematics::CombinatoricsGeneral Computer SciencePolyominoPolyominoesRegular polygonReconstruction algorithmReconstructionComputer Science(all)Theoretical Computer ScienceMathematicsTheoretical Computer Science
researchProduct

k-Weakly almost convex groups and ? 1 ? $$\tilde M^3 $$

1993

We extend Cannon's notion ofk-almost convex groups which requires that for two pointsx, y on then-sphere in the Cayley graph which can be joined by a pathl1 of length ≤k, there is a second pathl2 in then-ball, joiningx andy, of bounded length ≤N(k). Ourk-weakly almost convexity relaxes this condition by requiring only thatl1 ∝l2 bounds a disk of area ≤C1(k)n1 - e(k) +C2(k). IfM3 is a closed 3-manifold with 3-weakly almost convex fundamental group, then π1∞\(\tilde M^3 = 0\).

CombinatoricsFundamental groupCayley graphDifferential geometryHyperbolic geometryBounded functionRegular polygonGeometry and TopologyAlgebraic geometryConvexityMathematicsGeometriae Dedicata
researchProduct

On Fine and Wilf's theorem for bidimensional words

2003

AbstractGeneralizations of Fine and Wilf's Periodicity Theorem are obtained for the case of bidimensional words using geometric arguments. The domains considered constitute a large class of convex subsets of R2 which include most parallelograms. A complete discussion is provided for the parallelogram case.

CombinatoricsLarge classDiscrete mathematicsGeneral Computer ScienceGeneralizationRegular polygonParallelogramWord (group theory)MathematicsTheoretical Computer ScienceComputer Science(all)Theoretical Computer Science
researchProduct

Uniform properties of collections of convex bodies

1991

CombinatoricsMixed volumeGeneral MathematicsConvex setRegular polygonConvex bodyMathematicsMathematische Annalen
researchProduct

A General Framework for the One Center Location Problem

1992

This paper deals with an optimization problem where the objective function F is defined on a real vector space X by F(x) = γ(w 1║x - a 1║1, ⋯, w n ║x - a n║ n ), a formula in which a 1, ⋯, a n are n given points in X, ║∙║1, ⋯, ║∙║ n n norms on X, w 1, ⋯, w n positive numbers and γ a monotone norm on ℝ n . A geometric description of the set of optimal solutions to the problem min F(x) is given, illustrated by some examples. When all norms ║∙║i are equal, and γ being successively the l 1 , l ∞ and l 2-norm, a particular study is made, which shows the peculiar role played by the l 1-norm.

CombinatoricsMonotone polygonOptimization problemMixed normNorm (mathematics)Real vectorPositive weightDual normMathematics
researchProduct

Locally Convex Quasi C*-Algebras and Their Structure

2020

Throughout this chapter \({{\mathfrak A}}_{\scriptscriptstyle 0}[\| \cdot \|{ }_{\scriptscriptstyle 0}]\) denotes a unital C*-algebra and τ a locally convex topology on \({{\mathfrak A}}_{\scriptscriptstyle 0}\). Let \(\widetilde {{{\mathfrak A}}_{\scriptscriptstyle 0}}[\tau ]\) denote the completion of \({{\mathfrak A}}_{\scriptscriptstyle 0}\) with respect to the topology τ. Under certain conditions on τ, a subspace \({\mathfrak A}\) of \(\widetilde {{{\mathfrak A}}_{\scriptscriptstyle 0}}[\tau ]\), containing \({{\mathfrak A}}_{\scriptscriptstyle 0}\), will form (together with \({{\mathfrak A}}_{\scriptscriptstyle 0}\)) a locally convex quasi *-algebra \(({\mathfrak A}[\tau ],{{\mathfrak…

CombinatoricsPhysicsUnitalRegular polygonStructure (category theory)Algebra over a fieldMathematics::Representation Theory
researchProduct