Search results for "Regular polygon"
showing 10 items of 132 documents
Fixed point properties and proximinality in Banach spaces
2009
Abstract In this paper we prove the existence of a fixed point for several classes of mappings (mappings admitting a center, nonexpansive mappings, asymptotically nonexpansive mappings) defined on the closed convex subsets of a Banach space satisfying some proximinality conditions. In particular, we derive a sufficient condition, more general than weak star compactness, such that if C is a bounded closed convex subset of l 1 satisfying this condition, then every nonexpansive mapping T : C → C has a fixed point.
2-SYMMETRIC CRITICAL POINT THEOREMS FOR NON-DIFFERENTIABLE FUNCTIONS
2008
AbstractIn this paper, some min–max theorems for even andC1functionals established by Ghoussoub are extended to the case of functionals that are the sum of a locally Lipschitz continuous, even term and a convex, proper, lower semi-continuous, even function. A class of non-smooth functionals admitting an unbounded sequence of critical values is also pointed out.
On computing the degree of convexity of polyominoes
2015
In this paper we present an algorithm which has as input a convex polyomino $P$ and computes its degree of convexity, defined as 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. The algorithm uses space $O(m + n)$ to represent a polyomino $P$ with $n$ rows and $m$ columns, and has a running time $O(min(m; r k))$, where $r$ is the number of corners of $P$. Moreover, the algorithm leads naturally to a decomposition of $P$ into simpler polyominoes.
The existence of best proximity points in metric spaces with the property UC
2009
Abstract Eldred and Veeramani in [A.A. Eldred, P. Veeramani, Existence and convergence of best proximity points, J. Math. Anal. Appl., 323 (2006), 1001–1006. MR2260159] proved a theorem which ensures the existence of a best proximity point of cyclic contractions in the framework of uniformly convex Banach spaces. In this paper we introduce a notion of the property UC and extend the Eldred and Veeramani theorem to metric spaces with the property UC.
Enumeration of L-convex polyominoes by rows and columns
2005
In this paper, we consider the class of L-convex polyominoes, i.e. the convex polyominoes in which any two cells can be connected by a path of cells in the polyomino that switches direction between the vertical and the horizontal at most once.Using the ECO method, we prove that the number fn of L-convex polyominoes with perimeter 2(n + 2) satisfies the rational recurrence relation fn = 4fn-1 - 2fn-2, with f0 = 1, f1 = 2, f2 = 7. Moreover, we give a combinatorial interpretation of this statement. In the last section, we present some open problems.
Compound conditionals, Fr\'echet-Hoeffding bounds, and Frank t-norms
2021
Abstract In this paper we consider compound conditionals, Frechet-Hoeffding bounds and the probabilistic interpretation of Frank t-norms. By studying the solvability of suitable linear systems, we show under logical independence the sharpness of the Frechet-Hoeffding bounds for the prevision of conjunctions and disjunctions of n conditional events. In addition, we illustrate some details in the case of three conditional events. We study the set of all coherent prevision assessments on a family containing n conditional events and their conjunction, by verifying that it is convex. We discuss the case where the prevision of conjunctions is assessed by Lukasiewicz t-norms and we give explicit s…
Optimal Control Under Fuzzy Conditions for Dynamical Systems Associated with the Second Order Linear Differential Equations
2020
This paper is devoted to an optimal trajectory planning problem with uncertainty in location conditions considered as a problem of constrained optimal control for dynamical systems. Fuzzy numbers are used to incorporate uncertainty of constraints into the classical setting of the problem under consideration. The proposed approach applied to dynamical systems associated with the second order linear differential equations allows to find an optimal control law at each \(\alpha \)-level using spline-based methods developed in the framework of the theory of splines in convex sets. The solution technique is illustrated by numerical examples.
Passive congregation based particle swam optimization (pso) with self-organizing hierarchical approach for non-convex economic dispatch
2017
This paper proposes a passive congregation based PSO with self-organizing hierarchical algorithm approach for solving the economic dispatch problem of power system, where some of the units have prohibited operating zones. This Algorithm is known to perform better than conventional gradient based optimization methods for non-convex optimization problems. Conventional PSO algorithm is a population based heuristic search, employing problem of premature convergence. In this work, an innovative approach based on the concept of passive congregation based PSO with self-organizing hierarchical approach is employed to overcome the problem of premature convergence in classical PSO method.
Radiating and non-radiating sources in elasticity
2018
In this work, we study the inverse source problem of a fixed frequency for the Navier's equation. We investigate that nonradiating external forces. If the support of such a force has a convex or non-convex corner or edge on their boundary, the force must be vanishing there. The vanishing property at corners and edges holds also for sufficiently smooth transmission eigenfunctions in elasticity. The idea originates from the enclosure method: The energy identity and new type exponential solutions for the Navier's equation.
Fast Graph Filters for Decentralized Subspace Projection
2020
A number of inference problems with sensor networks involve projecting a measured signal onto a given subspace. In existing decentralized approaches, sensors communicate with their local neighbors to obtain a sequence of iterates that asymptotically converges to the desired projection. In contrast, the present paper develops methods that produce these projections in a finite and approximately minimal number of iterations. Building upon tools from graph signal processing, the problem is cast as the design of a graph filter which, in turn, is reduced to the design of a suitable graph shift operator. Exploiting the eigenstructure of the projection and shift matrices leads to an objective whose…