Results 21 to 30 of about 1,955 (244)
A Polynomial-Time Algorithm for Special Cases of the Unbounded Subset-Sum Problem
19 ...
Majid Salimi, Hamid Mala
openaire +2 more sources
Representations of bornologies
Bornologies abstract the properties of bounded sets of a metric space. But there are unbounded bornologies on a metric space like $\mathcal{P}(\RR)$ with the Euclidean metric.
Homeira Pajoohesh
doaj +1 more source
Convexity, Markov Operators, Approximation, and Related Optimization
The present review paper provides recent results on convexity and its applications to the constrained extension of linear operators, motivated by the existence of subgradients of continuous convex operators, the Markov moment problem and related Markov ...
Octav Olteanu
doaj +1 more source
A ballean (or coarse space) is a set endowed with a coarse structure. A ballean X is called normal if any two asymptotically disjoint subsets of X are asymptotically separated.
Igor Protasov
doaj +1 more source
Three Representations for Set Partitions
The Set Partitioning Problem (SPP) aims to obtain non-empty disjoint subsets of objects such that their union equals the whole set of objects, and the partition meets some prespecified criteria.
Jose Torres-Jimenez +4 more
doaj +1 more source
On Hahn-Banach theorem and some of its applications
First, this work provides an overview of some of the Hahn-Banach type theorems. Of note, some of these extension results for linear operators found recent applications to isotonicity of convex operators on a convex cone.
Olteanu Octav
doaj +1 more source
The sets that are scissor congruent to an unbounded convex subset of the plane [PDF]
It is shown that an unbounded convex plane body is scissor congruent to the union of a congruent body with a finite number of arbitrary topological discs. It is proved that ’is scissor congruent to’ is an equivalence relation. Thus two unbounded convex plane bodies are scissor congruent if and only if the union of one with a finite number of ...
openaire +1 more source
AbstractFor a group $G$ let $\gamma ^{\max }_G(n)$ denote the maximum number of length-$n$ words over an arbitrary $n$-letter subset of $G$. If $G$ is finitely generated and residually finite, then either $\gamma ^{\max }_G(n)$ is exponentially bounded, if and only if $G$ is virtually abelian, or $\gamma ^{\max }_G(n)\geq ~\left (e^{-\frac {1}{4}}+o(1)\
Be’eri Greenfeld, Hagai Lavner
openaire +1 more source
This paper deals with the asymptotic behavior of solutions to non-autonomous, fractional, stochastic p-Laplacian equations driven by additive white noise and random terms defined on the unbounded domain ℝN.
Renhai Wang, Bixiang Wang
doaj +1 more source
A State of the Art Review of Systems of Linear Inequalities and Related Observability Problems
This work is a short review of the state of the art aiming to contribute to the use, disclosure, and propagation of systems of linear inequalities in real life, teaching, and research.
Enrique Castillo
doaj +1 more source

