Search results for "combinatoric"

showing 10 items of 1776 documents

Poincaré inequalities and Steiner symmetrization

1996

A complete geometric characterization for a general Steiner symmetric domain Ω ⊂ Rn to satisfy the Poincare inequality with exponent p > n−1 is obtained and it is shown that this range of exponents is best possible. In the case where the Steiner symmetric domain is determined by revolving the graph of a Lipschitz continuous function, it is shown that the preceding characterization works for all p > 1 and furthermore for such domains a geometric characterization for a more general Sobolev–Poincare inequality to hold is given. Although the operation of Steiner symmetrization need not always preserve a Poincare inequality, a general class of domains is given for which Poincare inequalities are…

Finite volume methodGeneral MathematicsA domainPoincaré inequalityLipschitz continuityCombinatoricssymbols.namesakeinequalitiesPoincaré conjecturesymbolsExponentSymmetrization46E35Locally integrable function26D10Mathematics
researchProduct

Critical points of higher order for the normal map of immersions in Rd

2012

We study the critical points of the normal map v : NM -> Rk+n, where M is an immersed k-dimensional submanifold of Rk+n, NM is the normal bundle of M and v(m, u) = m + u if u is an element of NmM. Usually, the image of these critical points is called the focal set. However, in that set there is a subset where the focusing is highest, as happens in the case of curves in R-3 with the curve of the centers of spheres with contact of third order with the curve. We give a definition of r-critical points of a smooth map between manifolds, and apply it to study the 2 and 3-critical points of the normal map in general and the 2-critical points for the case k = n = 2 in detail. In the later case we a…

Focal setImage (category theory)Mathematical analysisCritical pointsStrong principal directionsSubmanifoldCombinatoricsNormal mapNormal bundleNormal mappingOrder (group theory)Geometry and TopologyVeronese of curvatureEllipse of curvatureMATEMATICA APLICADAMathematicsTopology and its Applications
researchProduct

Lie algebra on the transverse bundle of a decreasing family of foliations

2010

Abstract J. Lehmann-Lejeune in [J. Lehmann-Lejeune, Cohomologies sur le fibre transverse a un feuilletage, C.R.A.S. Paris 295 (1982), 495–498] defined on the transverse bundle V to a foliation on a manifold M, a zero-deformable structure J such that J 2 = 0 and for every pair of vector fields X , Y on M: [ J X , J Y ] − J [ J X , Y ] − J [ X , J Y ] + J 2 [ X , Y ] = 0 . For every open set Ω of V, J. Lehmann-Lejeune studied the Lie Algebra L J ( Ω ) of vector fields X defined on Ω such that the Lie derivative L ( X ) J is equal to zero i.e., for each vector field Y on Ω : [ X , J Y ] = J [ X , Y ] and showed that for every vector field X on Ω such that X ∈ K e r J , we can write X = ∑ [ Y ,…

Foliacions (Matemàtica)Zero (complex analysis)General Physics and AstronomyGeometryLie Àlgebres deManifoldCombinatoricsTransverse planeLie algebraFoliation (geology)Lie derivativeVector fieldFiber bundleGeometry and TopologyMathematical PhysicsMathematics
researchProduct

The Intersection of $3$-Maximal Submonids

2020

Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially decomposed into at most $k$ words. We characterize the intersection in the case of two $3$-maximal monoids.

Free graphSettore INF/01 - InformaticaGeneral Computer ScienceMathematics::Category Theory3-maximal monoidsMathematics - CombinatoricsComputer Science - Formal Languages and Automata Theory68R15IntersectionTheoretical Computer Science
researchProduct

Table of Periodic Properties of Fullerenes Based on Structural Parameters.

2004

The periodic table (PT) of the elements suggests that hydrogen could be the origin of everything else. The construction principle is an evolutionary process that is formally similar to those of Darwin and Oparin. The Kekulé structure count and permanence of the adjacency matrix of fullerenes are related to structural parameters involving the presence of contiguous pentagons p, q and r. Let p be the number of edges common to two pentagons, q the number of vertices common to three pentagons, and r the number of pairs of nonadjacent pentagon edges shared between two other pentagons. Principal component analysis (PCA) of the structural parameters and cluster analysis (CA) of the fullerenes perm…

FullereneChemistryGeneral ChemistryGeneral MedicineComputer Science ApplicationsPentagonCombinatoricsAlgebraCharacter (mathematics)Computational Theory and MathematicsPrincipal component analysisCluster (physics)Order (group theory)Rank (graph theory)Table (database)Adjacency matrixInformation SystemsMathematicsChemInform
researchProduct

Locally convex quasi *-algebras with sufficiently many *-representations

2012

AbstractThe main aim of this paper is the investigation of conditions under which a locally convex quasi ⁎-algebra (A[τ],A0) attains sufficiently many (τ,tw)-continuous ⁎-representations in L†(D,H), to separate its points. Having achieved this, a usual notion of bounded elements on A[τ] rises. On the other hand, a natural order exists on (A[τ],A0) related to the topology τ, that also leads to a kind of bounded elements, which we call “order bounded”. What is important is that under certain conditions the latter notion of boundedness coincides with the usual one. Several nice properties of order bounded elements are extracted that enrich the structure of locally convex quasi ⁎-algebras.

Fully representable quasi .-algebraApplied MathematicsBounded elementStructure (category theory)Regular polygonQuasi ⁎-algebraCombinatoricsFully representable quasi ⁎-algebraSettore MAT/05 - Analisi MatematicaBounded functionQuasi *-algebraOrder (group theory)Representable linear functionalAnalysisTopology (chemistry)Mathematics
researchProduct

The cartesian closed bicategory of generalised species of structures

2007

AbstractThe concept of generalised species of structures between small categories and, correspondingly, that of generalised analytic functor between presheaf categories are introduced. An operation of substitution for generalised species, which is the counterpart to the composition of generalised analytic functors, is also put forward. These definitions encompass most notions of combinatorial species considered in the literature — including of course Joyal's original notion — together with their associated substitution operation. Our first main result exhibits the substitution calculus of generalised species as arising from a Kleisli bicategory for a pseudo-comonad on profunctors. Our secon…

FunctorGeneral MathematicsSubstitution (logic)species of structures analytic functorPresheafComposition (combinatorics)BicategoryMathematics::Algebraic TopologyAlgebraCartesian closed categoryCombinatorial speciesMathematics::Category Theorybicategory cartesian closed categoriesMathematicsJournal of the London Mathematical Society
researchProduct

On the proper homotopy invariance of the Tucker property

2006

A non-compact polyhedron P is Tucker if, for any compact subset K ⊂ P, the fundamental group π1(P − K) is finitely generated. The main result of this note is that a manifold which is proper homotopy equivalent to a Tucker polyhedron is Tucker. We use Poenaru’s theory of the equivalence relations forced by the singularities of a non-degenerate simplicial map.

Fundamental groupHomotopy lifting propertyApplied MathematicsGeneral MathematicsHomotopyMathematics::Optimization and ControlhomotopyproperComputer Science::Numerical AnalysisRegular homotopyCombinatoricsn-connectedPolyhedronEquivalence relationtucker propertySimplicial mapMathematics
researchProduct

Optimization Under Fuzzy Max-t-Norm Relation Constraints

2019

Fuzzy relation equations and inequalities play an important role in many tools of fuzzy modelling and have been extensively studied. In many practical applications they are used as constraints in optimization. Algorithms for specific objective functions have been proposed by many authors. In this paper we introduce a method to convert a system of fuzzy relation constraints with max-t-norm composition to a linear constraint system by adding integer variables. A numerical example is provided to illustrate the proposed method.

Fuzzy modellingConstraint (information theory)Mathematical optimizationRelation (database)Mathematics::Metric GeometryT-normComposition (combinatorics)Fuzzy logicMathematicsInteger (computer science)
researchProduct

Ornamenti un Simetrijas: Ornamentālo Rakstu Zīmju Valoda (intervija ar Modri Tenisonu)

2010

Ornaments and Symmetry: Language of Signs of Ornamental Tracery (see interview with Modris Tenisons http://www.blip.tv/file/3173653) In his first interview Modris Tenisons explains language of ornamentalistic signs for national ornamental belts using his discovered law of sieve displacement, which gives base duality element in ornamentalistic signs, and routine how to generate 240 elements of signs from 10 “seeds of chaos” sufficient to produce all ornametal belts of first order. He tells also about his discoverd 16 sign alphabet, that does the same. Pirmajā mutvārdu liecinājumā Modris Tenisons stāsta par ornamentālo rakstu zīmju veidošanās likumsakarībām sakrustojot divu krāsu diegus audum…

GR FolkloreBH AestheticsQA01 CombinatoricsBL Religion
researchProduct