Results 1 to 10 of about 850,517 (217)
"Convex" characterization of linearly convex domains [PDF]
MATHEMATICA SCANDINAVICA, 2011 We prove that a $C^{1,1}$-smooth bounded domain $D$ in $\C^n$ is linearly convex if and only if the convex hull of any two discs in $D$ with common center lies in $D.$Comment: to appear in Math.
Nikolov, Nikolai, Thomas, Pascal J.
core +6 more sources
On Column-Convex and Convex Carlitz Polyominoes [PDF]
Mathematics in Computer Science, 2021 In this paper, we introduce and study {\it Carlitz polyominoes}. In particular, we show that, as $n$ grows to infinity, asymptotically the number of \begin{enumerate} \item column-convex Carlitz polyominoes with perimeter $2n$ is \beq \frac{9\sqrt{2}(14+3\sqrt{3})}{2704\sqrt{ n^3}}4^n. \feq \item convex Carlitz polyominoes with perimeter $2n$ is \beq \
Armend Shaban Shabani +3 more
openaire +3 more sources
Triangulability of convex graphs and convex skewness [PDF]
Discrete Mathematics, Algorithms and Applications, 2021 Suppose [Formula: see text] is a subgraph of a convex complete graph [Formula: see text] and [Formula: see text] contains no boundary edge of [Formula: see text] and [Formula: see text]. We determine necessary and sufficient conditions on [Formula: see text] such that [Formula: see text] admits a triangulation.
Adem Kilicman +5 more
openaire +3 more sources
Biometrics, 2016 SummaryIn the biclustering problem, we seek to simultaneously group observations and features. While biclustering has applications in a wide array of domains, ranging from text mining to collaborative filtering, the problem of identifying structure in high-dimensional genomic data motivates this work.
Genevera I. Allen +2 more
openaire +4 more sources
A convex polynomial that is not sos-convex [PDF]
Mathematical Programming, 2011 15 ...
Pablo A. Parrilo, Amir Ali Ahmadi
openaire +3 more sources
Convex Functions on Convex Polytopes [PDF]
Proceedings of the American Mathematical Society, 1968 The behavior of convex functions is of interest in connection with a wide variety of optimization problems. It is shown here that this behavior is especially simple, in certain respects, when the domain is a polytope or belongs to certain classes of sets closely related to polytopes; moreover, the polytopes and related classes are actually ...
David Gale +2 more
openaire +2 more sources
On the moduli of convexity [PDF]
Proceedings of the American Mathematical Society, 2007 [EN] It is known that, given a Banach space (X, parallel to center dot parallel to), the modulus of convexity associated to this space delta X is a non-negative function, nondecreasing, bounded above by the modulus of convexity of any Hilbert space and satisfies the equation delta x(epsilon)/epsilon(2)
Guirao Sánchez, Antonio José +1 more
openaire +4 more sources
Convex Defining Functions for Convex Domains [PDF]
Journal of Geometric Analysis, 2010 21 ...
Jeffery D. McNeal, A. K. Herbig
openaire +4 more sources
Convex and exact games with non-transferable utility [PDF]
, 2010 We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact.
Csóka, Péter +3 more
core +1 more source
Ball and Spindle Convexity with respect to a Convex Body [PDF]
, 2012 Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$.
Lángi, Zsolt +2 more
core +2 more sources