Results 41 to 50 of about 454,550 (157)

Natural Partial Orders on Transformation Semigroups with Fixed Sets

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2016
Let X be a nonempty set. For a fixed subset Y of X, let FixX,Y be the set of all self-maps on X which fix all elements in Y. Then FixX,Y is a regular monoid under the composition of maps.
Yanisa Chaiya   +2 more
doaj   +1 more source

Superextensions of cyclic semigroups

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2013
Given a cyclic semigroup $S$ we study right and left zeros,singleton left ideals, the minimal ideal, left cancelable andright cancelable elements of superextensions $lambda(S)$ andcharacterize cyclic semigroups whose superextensions arecommutative.
V. M. Gavrylkiv
doaj   +3 more sources

The Minimal Geometric Deformation Approach: A Brief Introduction

open access: yesAdvances in High Energy Physics, 2017
We review the basic elements of the Minimal Geometric Deformation approach in detail. This method has been successfully used to generate brane-world configurations from general relativistic perfect fluid solutions.
J. Ovalle, R. Casadio, A. Sotomayor
doaj   +1 more source

Safe Element Screening for Submodular Function Minimization

open access: yesCoRR, 2018
Submodular functions are discrete analogs of convex functions, which have applications in various fields, including machine learning and computer vision. However, in large-scale applications, solving Submodular Function Minimization (SFM) problems remains challenging.
Weizhong Zhang   +4 more
openaire   +3 more sources

Generalized minimal nets in form finding of prestressed cable nets

open access: yesGrađevinar, 2013
Form finding problem of prestressed cable structures is formulated as a variational problem whose solutions are minimal and generalized minimal nets. Kinematic constrains are introduced that allow assignment of chosen lengths to elements.
Krešimir Fresl   +2 more
doaj   +1 more source

Convergence of Minimal and Approximate Minimal Elements of Sets in Partially Ordered Vector Spaces

open access: yesJournal of Mathematical Analysis and Applications, 1999
Let \(Z\) be a real normed vector space partially ordered by a closed convex pointed cone \(C\) with nonempty interior, and let \(A\) be a nonempty set in \(Z\). In the first part of the paper the authors point out conditions of minimal character ensuring that the set \(\operatorname {Min}A= \{a\in A\mid (a-C)\cap (A\setminus\{a\})= \emptyset ...
P. LORIDAN   +2 more
openaire   +3 more sources

Explicit construction of states in orbifolds of products of N=2 superconformal ADE minimal models

open access: yesNuclear Physics B
We generalize the explicit construction of fields in orbifolds of products of N=(2,2) minimal models, developed by A. Belavin, V. Belavin and S. Parkhomenko to include minimal models with D and E-type modular invariants.
Boris Eremin, Sergej Parkhomenko
doaj   +1 more source

The minimal number of basic elements in a multiset antichain

open access: yesJournal of Combinatorial Theory, Series A, 1978
AbstractLet M be a finite set consisting of ki elements of type i, i = 1, 2,…, n and let S denote the set of subsets of M or, equivalently, the set of all vectors x = (x1, x2,…,xn) with integral coefficients xi satisfying 0 ⩽ xi ⩽ ki, i = 1, 2,…, n.
openaire   +1 more source

Recommended Clinical Context and Patient Context Data Elements for Liquid Biopsy Data Submitted to Data Repositories and Data Commons

open access: yesClinical and Translational Science
In 2020, BLOODPAC recommended 11 pre‐analytical minimal technical data elements for collection and submission of liquid biopsy data to public databases.
Robert L. Grossman   +21 more
doaj   +1 more source

Minimal length elements of Thompson’s groups F(p)

open access: yesGeometriae Dedicata, 2009
We describe a method for determining the minimal length of elements in the generalized Thompson's groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications.
Fordham, S. Blake, Cleary, Sean
openaire   +3 more sources

Home - About - Disclaimer - Privacy