Search results for "Arity"

showing 10 items of 2893 documents

Multiple solutions for a Dirichlet problem with p-Laplacian and set-valued nonlinearity

2008

AbstractThe existence of a negative solution, of a positive solution, and of a sign-changing solution to a Dirichlet eigenvalue problem with p-Laplacian and multi-valued nonlinearity is investigated via sub- and supersolution methods as well as variational techniques for nonsmooth functions.

Dirichlet problemGeneral MathematicsMathematical analysisNull (mathematics)Multiple solutions Dirichlet problem p-Laplacian set-valued nonlinearitySet (abstract data type)symbols.namesakeGeneralized gradientNonlinear systemDirichlet eigenvalueSettore MAT/05 - Analisi MatematicaDirichlet's principlep-LaplaciansymbolsMathematics
researchProduct

Elliptic equations having a singular quadratic gradient term and a changing sign datum

2012

In this paper we study a singular elliptic problem whose model is \begin{eqnarray*} - \Delta u= \frac{|\nabla u|^2}{|u|^\theta}+f(x), in \Omega\\ u = 0, on \partial \Omega; \end{eqnarray*} where $\theta\in (0,1)$ and $f \in L^m (\Omega)$, with $m\geq \frac{N}{2}$. We do not assume any sign condition on the lower order term, nor assume the datum $f$ has a constant sign. We carefully define the meaning of solution to this problem giving sense to the gradient term where $u=0$, and prove the existence of such a solution. We also discuss related questions as the existence of solutions when the datum $f$ is less regular or the boundedness of the solutions when the datum $f \in L^m (\Omega)$ with …

Dirichlet problemPure mathematicsApplied MathematicsMathematical analysissingularity at zeroMathematics::Analysis of PDEsGeodetic datumTerm (logic)Omegadata with non-constant signdata with non-constant sign; dirichlet problem; singularity at zero; gradient termQuadratic equationgradient termNabla symboldirichlet problemConstant (mathematics)AnalysisMathematicsSign (mathematics)Communications on Pure and Applied Analysis
researchProduct

Positive solutions of Dirichlet and homoclinic type for a class of singular equations

2018

Abstract We study a nonlinear singular boundary value problem and prove that, depending on a relationship between exponents of power terms, the problem has either solutions of Dirichlet type or homoclinic solutions. We make use of shooting techniques and lower and upper solutions.

Dirichlet problemPure mathematicsClass (set theory)SingularityApplied Mathematics010102 general mathematicsAnalysiType (model theory)01 natural sciencesDirichlet distributionPositive solution010101 applied mathematicssymbols.namesakeNonlinear systemSingularityHomoclinic solutionsymbolsHomoclinic orbitBoundary value problem0101 mathematicsAnalysisDirichlet problemMathematicsJournal of Mathematical Analysis and Applications
researchProduct

On Noncoercive (p, q)-Equations

2021

We consider a nonlinear Dirichlet problem driven by a (p, q)-Laplace differential operator (1 < q < p). The reaction is (p - 1)-linear near +/-infinity and the problem is noncoercive. Using variational tools and truncation and comparison techniques together with critical groups, we produce five nontrivial smooth solutions all with sign information and ordered. In the particular case when q = 2, we produce a second nodal solution for a total of six nontrivial smooth solutions all with sign information.

Dirichlet problemTruncationGeneral MathematicsMathematical analysisGeneral Physics and AstronomyDifferential operator(pq)-LaplacianNonlinear systemextremal solutionsprincipal eigenvalueSettore MAT/05 - Analisi Matematicanonlinear regularityconstant sign and nodal solutionsSign (mathematics)Mathematics
researchProduct

An exact, complete and efficient implementation for computing planar maps of quadric intersection curves

2005

We present the first exact, complete and efficient implementation that computes for a given set P=p1,...,pn of quadric surfaces the planar map induced by all intersection curves p1∩ pi, 2 ≤ i ≤ n, running on the surface of p1. The vertices in this graph are the singular and x-extreme points of the curves as well as all intersection points of pairs of curves. Two vertices are connected by an edge if the underlying points are connected by a branch of one of the curves. Our work is based on and extends ideas developed in [20] and [9].Our implementation is complete in the sense that it can handle all kind of inputs including all degenerate ones where intersection curves have singularities or pa…

Discrete mathematicsCombinatoricssymbols.namesakeGeometric designQuadricDegenerate energy levelsAlgebraic surfaceFamily of curvessymbolsGravitational singularityAlgebraic curveMathematicsPlanar graphProceedings of the twenty-first annual symposium on Computational geometry
researchProduct

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

2007

The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…

Discrete mathematicsDegree (graph theory)ComputationDegenerate energy levelsACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION/I.1.2: Algorithms/I.1.2.0: Algebraic algorithms020207 software engineering010103 numerical & computational mathematics02 engineering and technology[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.3: EfficiencyCombinatoricsIntersection0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Adjacency listGravitational singularity0101 mathematicsAlgebraic numberACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysisMathematics
researchProduct

Weak regularity of functions and sets in Asplund spaces

2006

Abstract In this paper, we study a new concept of weak regularity of functions and sets in Asplund spaces. We show that this notion includes prox-regular functions, functions whose subdifferential is weakly submonotone and amenable functions in infinite dimension. We establish also that weak regularity is equivalent to Mordukhovich regularity in finite dimension. Finally, we give characterizations of the weak regularity of epi-Lipschitzian sets in terms of their local representations.

Discrete mathematicsDimension (vector space)Applied MathematicsPartition regularityMathematics::Optimization and ControlSubderivativeAnalysisMathematicsNonlinear Analysis: Theory, Methods & Applications
researchProduct

Generating restricted classes of involutions, Bell and Stirling permutations

2010

AbstractWe present a recursive generating algorithm for unrestricted permutations which is based on both the decomposition of a permutation as a product of transpositions and that as a union of disjoint cycles. It generates permutations at each recursive step and slight modifications of it produce generating algorithms for Bell permutations and involutions. Further refinements yield algorithms for these classes of permutations subject to additional restrictions: a given number of cycles or/and fixed points. We obtain, as particular cases, generating algorithms for permutations counted by the Stirling numbers of the first and second kind, even permutations, fixed-point-free involutions and d…

Discrete mathematicsGolomb–Dickman constantMathematics::CombinatoricsStirling numbers of the first kindParity of a permutationTheoretical Computer ScienceCombinatoricsDerangementPermutationComputational Theory and MathematicsRandom permutation statisticsDiscrete Mathematics and CombinatoricsStirling numberGeometry and TopologyRencontres numbersMathematicsMathematicsofComputing_DISCRETEMATHEMATICSEuropean Journal of Combinatorics
researchProduct

Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs

2017

Parity RAIDs are used to protect storage systems against disk failures. The idea is to add redundancy to the system by storing the parity of subsets of disks on extra parity disks. A simple two-dimensional scheme is the one in which the data disks are arranged in a rectangular grid, and every row and column is extended by one disk which stores the parity of it.In this paper we describe several two-dimensional parity RAIDs and analyse, for each of them, the probability for dataloss given that f random disks fail. This probability can be used to determine the overall probability using the model of Hafner and Rao. We reduce subsets of the forest counting problem to the different cases and show…

Discrete mathematicsHardware_MEMORYSTRUCTURESRAIDComputer science020206 networking & telecommunications02 engineering and technologyData lossGridElectronic mail020202 computer hardware & architecturelaw.inventionExact algorithmCounting problemlawData_FILES0202 electrical engineering electronic engineering information engineeringTutte polynomialParity (mathematics)2017 13th European Dependable Computing Conference (EDCC)
researchProduct

Random analysis of geometrically non-linear FE modelled structures under seismic actions

1990

Abstract In the framework of the finite element (FE) method, by using the “total Lagrangian approach”, the stochastic analysis of geometrically non-linear structures subjected to seismic inputs is performed. For this purpose the equations of motion are written with the non-linear contribution in an explicit representation, as pseudo-forces, and with the ground motion modelled as a filtered non-stationary white noise Gaussian process, using a Tajimi-Kanai-like filter. Then equations for the moments of the response are obtained by extending the classical Ito's rule to vectors of random processes. The equations of motion, and the equations for moments, obtained here, show a perfect formal simi…

Discrete mathematicsHermite polynomialsSimilarity (geometry)Random excitation; non-linear structuresStochastic processMathematical analysisEquations of motionBuilding and ConstructionWhite noiseFinite element methodRandom excitationNonlinear systemsymbols.namesakesymbolsnon-linear structuresSafety Risk Reliability and QualityGaussian processCivil and Structural EngineeringMathematics
researchProduct