Related papers: Quasi-concave functions on antimatroids
We introduce the notion of quasi-log complex analytic spaces and establish various fundamental properties. Moreover, we prove that a semi-log canonical pair naturally has a quasi-log complex analytic space structure. This paper is part of…
This paper presents weakened notions of corewise stability and setwise stability for matching markets where agents have substitutable choice functions. We introduce the concepts of worker-quasi-core, firm-quasi-core, and worker-quasisetwise…
To every nearly convex optimization problem, that is a minimization problem with a nearly convex objective function and a nearly convex constraint set, we associate a uniquely defined convex optimization problem with a lower semicontinuous…
This paper introduces semiopen and semiclosed soft sets in soft topological spaces. The notions of interior and closure are generalized using these sets. A detail study is carried out on properties of semiopen, semiclosed soft sets, semi…
In this paper, we introduce the topological structure of fuzzy parametrized soft sets and fuzzy parametrized soft mappings. We define the notion of quasi-coincidence for fuzzy parametrized soft sets and investigated basic properties of it.…
Extending and unifying concepts extensively used in the literature, we introduce the notion of approximable interpolation sets for algebras of functions on locally compact groups, especially for weakly almost periodic functions and for…
We introduce a general unifying framework for the investigation of pointlike sets. The pointlike functors are considered as distinguished elements of a certain lattice of subfunctors of the power semigroup functor; in particular, we exhibit…
Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…
The problem of minimizing an entropy functional subject to linear constraints is a useful example of partially finite convex programming. In the 1990s, Borwein and Lewis provided broad and easy-to-verify conditions that guarantee strong…
We define a new basis of quasisymmetric functions, the row-strict dual immaculate functions, as the generating function of a particular set of tableaux. We establish that this definition gives a function that can also be obtained by…
In this paper, we focus attention on extending the topological conjugacy of adding machine maps and minimal systems to iterated function systems. We provide necessary and sufficient conditions for an iterated function system to be…
Multisets are sets that allow repetition of elements. As such, multisets pave the way to a number of interesting possibilities of theoretical and applied nature. In the present work, after revising the main aspects of traditional sets, we…
This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…
Antimatroids were discovered by Dilworth in the context of lattices [4] and introduced by Edelman and Jamison as convex geometries in[5]. The author of the current paper independently discovered (possibly infinite) antimatroids in the…
Taking matrix as a synonym for a numerical function on the Cartesian product of two (in general, infinite) sets, a simple purely algebraic "reciprocity property" says that the set of rows spans a finite-dim space iff the set of columns does…
For a closed connected manifold N, we construct a family of functions on the Hamiltonian group G of the cotangent bundle T^*N, and a family of functions on the space of smooth functions with compact support on T^*N. These satisfy properties…
This letter studies the problem of minimizing increasing set functions, or equivalently, maximizing decreasing set functions, over the base of a matroid. This setting has received great interest, since it generalizes several applied…
In this article we introduce a new matroid invariant, a combinatorial analog of the topological zeta function of a polynomial. More specifically we associate to any ranked, atomic meet-semilattice L a rational function Z(L,s), in such a way…
We will generalize the concept of aggregation function for mathematical structures as a certain function between quantales. In fact, these functions turn to be exactly the lax morphism of quantales. This provides a global framework for the…
In this paper, we give some definitions on quasi-convex functions and we prove inequalities contain J-quasi-convex and W-quasi-convex functions. We give also some inclusions.