Search results for "Regular"

showing 10 items of 855 documents

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

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

Les squelettes : structures d'interaction directe et intuitive avec des formes 3D

2014

The interactions in shape creation graphic applications are far from natural. The user tends to avoid as much as possible such applications and prefer to sketch or model his/her shape.To bridge this widening gap between computer and the general public, we focus on skeletons. They are intuitive shape representation models that we propose to use as direct and intuitive interaction structures.All skeletons suffer from very low quality as shape representation models, concerning the geometry of the shape they capture, the quantity of skeletal noise they contain or the lack of useful organization of their elements. Moreover, some functionalities that must be granted to skeletons are only partiall…

GarbingSquelette[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingHiérarchieHabillageRegularisationBoundariesBordsHierarchyNoise[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingImportanceSkeleton[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
researchProduct

On the exhaustive generation of k-convex polyominoes

2017

The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we present a simple algorithm for computing the degree of convexity of a convex polyomino and we show how it can be used to design an algorithm that generates, given an integer k, all k-convex polyominoes of area n in constant amortized time, using space O(n). Furthermore, by applying few changes, we are able to generate all convex polyominoes whose degree of convexity is exactly k.

General Computer SciencePolyomino0102 computer and information sciences02 engineering and technologyComputer Science::Computational Geometry01 natural sciencesConvexityTheoretical Computer ScienceCombinatoricsCAT algorithmIntegerExhaustive generation0202 electrical engineering electronic engineering information engineeringConvex polyominoeConvexity K-convex polyominoes.Convex polyominoesComputer Science::DatabasesMathematicsDiscrete mathematicsAmortized analysisMathematics::CombinatoricsDegree (graph theory)Settore INF/01 - InformaticaComputer Science (all)Regular polygonMonotone polygon010201 computation theory & mathematicsPath (graph theory)020201 artificial intelligence & image processingCAT algorithms; Convex polyominoes; Exhaustive generation;CAT algorithms
researchProduct

Extending formal language hierarchies to higher dimensions

1999

General Computer ScienceProgramming languageComputer scienceObject languagecomputer.software_genreFormal systemTheoretical Computer ScienceFormal grammarDeterministic finite automatonRegular languageFormal languageAutomata theoryNondeterministic finite automatoncomputerACM Computing Surveys
researchProduct

F-signature of pairs: Continuity, p-fractals and minimal log discrepancies

2011

This paper contains a number of observations on the {$F$-signature} of triples $(R,\Delta,\ba^t)$ introduced in our previous joint work. We first show that the $F$-signature $s(R,\Delta,\ba^t)$ is continuous as a function of $t$, and for principal ideals $\ba$ even convex. We then further deduce, for fixed $t$, that the $F$-signature is lower semi-continuous as a function on $\Spec R$ when $R$ is regular and $\ba$ is principal. We also point out the close relationship of the signature function in this setting to the works of Monsky and Teixeira on Hilbert-Kunz multiplicity and $p$-fractals. Finally, we conclude by showing that the minimal log discrepancy of an arbitrary triple $(R,\Delta,\b…

General Mathematics010102 general mathematicsRegular polygonMultiplicity (mathematics)Mathematics - Commutative AlgebraCommutative Algebra (math.AC)01 natural sciencesUpper and lower bounds13A35 13D40 14B05 13H10 14F18CombinatoricsMathematics - Algebraic GeometryFractalClose relationship0103 physical sciencesFOS: Mathematics010307 mathematical physics0101 mathematicsAlgebraic Geometry (math.AG)Mathematics
researchProduct

Circular law for sparse random regular digraphs

2020

Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices. We show that, as long as $d\to\infty$ with $n$, the empirical spectral distribution of appropriately rescaled matrix $A_n$ converges weakly in probability to the circular law. This result, together with an earlier work of Cook, completely settles the problem of weak convergence of the empirical distribution in directed $d$-regular setting with the degree tending to infinity. As a crucial element of our proof, we develop a technique of bounding intermediate singular values of $A_n$ based on studyi…

General Mathematicsregular graphsrandom matrices01 natural sciencesCombinatoricsMatrix (mathematics)FOS: Mathematics60B20 15B52 46B06 05C80Adjacency matrix0101 mathematicsrandom graphsMathematicsRandom graphlogarithmic potentialWeak convergenceDegree (graph theory)sparse matricesApplied MathematicsProbability (math.PR)010102 general mathematicsCircular lawSingular valueCircular lawintermediate singular valuesRandom matrixMathematics - ProbabilityJournal of the European Mathematical Society
researchProduct

The Existence of Solutions for Local Dirichlet (r(u),s(u))-Problems

2022

In this paper, we consider local Dirichlet problems driven by the (r(u),s(u))-Laplacian operator in the principal part. We prove the existence of nontrivial weak solutions in the case where the variable exponents r,s are real continuous functions and we have dependence on the solution u. The main contributions of this article are obtained in respect of: (i) Carathéodory nonlinearity satisfying standard regularity and polynomial growth assumptions, where in this case, we use geometrical and compactness conditions to establish the existence of the solution to a regularized problem via variational methods and the critical point theory; and (ii) Sobolev nonlinearity, somehow related to the spac…

General Mathematicsregularized problem(<i>r</i>(<i>u</i>)<i>s</i>(u))-Laplacian operatorPalais-Smale conditionweak solutionComputer Science::Digital Libraries(<i>r</i>(<i>u</i>)<i>s</i>(u))-Laplacian operator; Palais-Smale condition; monotone operator; regularized problem; weak solutionSettore MAT/05 - Analisi Matematicamonotone operatorComputer Science (miscellaneous)QA1-939Computer Science::Programming Languages(r(u) s(u))-Laplacian operatorEngineering (miscellaneous)MathematicsMathematics
researchProduct

Integration by parts on generalized manifolds and applications on quasiregular maps

2016

General Mathematicsta111integration by partsquasiregular mappingsgeneralized manifoldsAnnales Academiae Scientiarum Fennicae Mathematica
researchProduct

Astrocytic alterations in interleukin-6/Soluble interleukin-6 receptor alpha double-transgenic mice.

2000

Interleukin-6 (IL-6), a major cytokine with diverse effects on cells mainly of the immune and hematopoietic systems, has been linked to several neurological disorders such as acquired immune deficiency syndrome dementia, multiple sclerosis, and Alzheimer's disease. Central nervous system (CNS)-specific expression of IL-6 caused neurodegeneration, massive gliosis, and vascular proliferation in transgenic mice. However, the effects of systemically circulating IL-6 and its receptor IL-6Ralpha on the CNS are unknown. IL-6Ralpha is the specific component of the IL-6 receptor system and hence an important co-factor of IL-6. IL-6Ralpha is bioactive in a membrane-bound and in a soluble (s) form. We…

Genetically modified mouseCentral Nervous SystemPathologymedicine.medical_specialtyTransgeneCentral nervous systemGene ExpressionMice TransgenicBiologyPathology and Forensic MedicineMicemedicineAnimalsHumansTransgenesReceptorInterleukin 6Interleukin-6NeurodegenerationBrainmedicine.diseaseReceptors Interleukin-6Astrogliosismedicine.anatomical_structurePhenotypeGliosisSolubilityAstrocytesbiology.proteinmedicine.symptomRegular ArticlesThe American journal of pathology
researchProduct