Search results for "Regular"

showing 10 items of 855 documents

Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

2008

Graphs and Algorithms

Discrete mathematicsGeneral Computer Science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Neighbourhood (graph theory)[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Feedback arc setTheoretical Computer ScienceCombinatorics[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Circulant graphChordal graphIndependent setDiscrete Mathematics and CombinatoricsMaximal independent setFeedback vertex setRegular graph[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]MathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Invariant measures for piecewise convex transformations of an interval

2002

Discrete mathematicsGeneral MathematicsPiecewiseRegular polygonInvariant measureInvariant (mathematics)MathematicsStudia Mathematica
researchProduct

Characterizing extreme points of polyhedra an extension of a result by Wolfgang Bühler

1982

This paper reconsiders the characterization given by Buhler admitting convex polyhedra of probability distributions on a finite or countable set which are given by systems of linear inequalities more complex than those considered before.

Discrete mathematicsGeneral MathematicsRegular polygonInteger points in convex polyhedraManagement Science and Operations ResearchCombinatoricsPolyhedronLinear inequalityConvex polytopeCountable setExtreme pointSoftwareSpherical polyhedronMathematicsZeitschrift für Operations Research
researchProduct

Some Nonlinear Methods in Fréchet Operator Rings and Ψ*-Algebras

1995

Two different inverse function theorems, one of Nash-Moser type, the other due to H. Omori, are extended to obtain special surjectivity results in locally convex and locally pseudo-convex Frechet algebras generated by group actions and derivations. In particular, the following factorization problem is discussed. Let Ψ be a locally pseudo-convex Frechet algebra with unit e and T+ : Ψ Ψ a continuous linear operator. Does there exist a neighborhood U of 0 such that the equation where T- = IΨ- T, has a solution x ∈ Ψ for every y ∈ U?

Discrete mathematicsGroup actionPure mathematicsGeneral MathematicsOperator (physics)Regular polygonInverse functionType (model theory)Fréchet algebraUnit (ring theory)Continuous linear operatorMathematicsMathematische Nachrichten
researchProduct

On product of p-sequential spaces

2016

Abstract The product of finitely many regular p-compact p-sequential spaces is p-compact p-sequential for any free ultrafilter p as it follows from [5] . In the paper is produced an example of a Hausdorff p-compact p-sequential space whose square is not p-sequential. It is also given an example of a space which is sP-radial, wP-radial, vwP-radial for any P ⊂ μ ( τ ) but its square is neither sP-radial nor wP-radial nor vwP-radial space.

Discrete mathematicsInner product spaceProduct (mathematics)UltrafilterHausdorff spaceRegular spaceAstrophysics::Earth and Planetary AstrophysicsGeometry and TopologyUrysohn and completely Hausdorff spacesSpace (mathematics)Normal spaceMathematicsTopology and its Applications
researchProduct

On some parameters related to weak noncompactness in L1(μ,E)

2009

Abstract A weak measure of noncompactness γU is defined in a Banach space in terms of convex compactness. We obtain relationships between the measure γU (A) of a bounded set A in the Bochner space L1 (μ,E) and two parameters Π(A) and Δ1(A). Then the criterion for relative weak compactness due to Ulger [19] and Diestel-Ruess-Schachermayer [11] is recovered.

Discrete mathematicsMathematics (miscellaneous)Compact spaceBounded setBochner integralRegular polygonBanach spaceBochner spaceMeasure (mathematics)MathematicsQuaestiones Mathematicae
researchProduct

On the optimal approximation rate of certain stochastic integrals

2010

AbstractGiven an increasing function H:[0,1)→[0,∞) and An(H)≔infτ∈Tn(∑i=1n∫ti−1ti(ti−t)H(t)2dt)12, where Tn≔{τ=(ti)i=0n:0=t0<t1<⋯<tn=1}, we characterize the property An(H)≤cn, and give conditions for An(H)≤cnβ and An(H)≥1cnβ for β∈(0,1), both in terms of integrability properties of H. These results are applied to the approximation of stochastic integrals.

Discrete mathematicsMathematics(all)Numerical AnalysisRegular sequencesGeneral MathematicsApplied MathematicsStochastic integralsNon linear approximationFunction (mathematics)CombinatoricsNon-linear approximationFunction compositionAnalysisMathematicsJournal of Approximation Theory
researchProduct

Ordering and Convex Polyominoes

2005

We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes. In the first part of the paper we study the closure properties of such families with respect to the order. In particular we obtain a new characterization of L-convex polyominoes: a discrete set P is a L-convex polyomino if and only if all the elements Q≼P are polyominoes. In the seco…

Discrete mathematicsMathematics::CombinatoricsPolyominoBinary relationRegular polygonConvex setDiscrete geometryMonotonic functionPartial OrderComputer Science::Computational GeometryMonotone FunctionCombinatoricsClosure PropertyBinary RelationFormal Language TheoryClosure (mathematics)Computer Science::Discrete MathematicsPartially ordered setComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Reconstruction of L-convex Polyominoes.

2003

Abstract We introduce the family of L-convex polyominoes, a subset of convex polyominoes whose elements satisfy a special convexity property. We develop an algorithm that reconstructs an L-convex polyomino from the set of its maximal L-polyominoes.

Discrete mathematicsMathematics::CombinatoricsProperty (philosophy)PolyominoApplied MathematicsRegular polygonPolyominoesComputer Science::Computational GeometryConvexityCombinatoricsSet (abstract data type)Computer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Tangency conditions for multivalued mappings

1996

We prove that interiority conditions imply tangency conditions for two multivalued mappings from a topological space into a normed vector space. As a consequence, we obtain the lower semicontinuity of the intersection of two multivalued mappings. An application to the epi-upper semicontinuity of the sum of convex vector-valued mappings is given.

Discrete mathematicsMathematics::Functional AnalysisIntersectionMathematics::Complex VariablesApplied MathematicsRegular polygonMathematics::General TopologyTangentTopological spaceAnalysisNormed vector spaceMathematicsSet-Valued Analysis
researchProduct