This study provides a basic introduction to agent-based modeling (ABM) as a powerful blend of classical and constructive mathematics, with a primary focus on its applicability for social science research. The typical goals of ABM social science researchers are discussed along with the culture-dish nature of their computer experiments. The applicability of ABM for science more generally is also ...

The singular cochain complex of a topological space is a classical object. It is a Differential Graded algebra which has been studied intensively with a range of methods, not least within rational homotopy theory. More recently, the tools of Auslander-Reiten theory have also been applied to the singular cochain complex. One of the highlights is that by these methods, each Poincaré duality space...

In this article, we introduce iterative methods (implicit and explicit) for finding a common fixed point set of a countable family of strict pseudo-contractions, which is a unique solution of some variational inequality. Furthermore, we prove the strong convergence theorems of such iterative scheme in a q-uniformly smooth Banach space which admits a weakly sequentially continuous generalized du...

We show that intersection homology extends Poincaré duality to manifold homotopically stratified spaces (satisfying mild restrictions). These spaces were introduced by Quinn to provide “a setting for the study of purely topological stratified phenomena, particularly group actions on manifolds.” The main proof techniques involve blending the global algebraic machinery of sheaf theory with local ...

One of the best ways of studying ordered algebraic structures is through their spectra. The three well-known spectra usually considered are the Brumfiel, Keimel, and the maximal spectra. The pointfree versions of these spectra were studied by B. Banaschewski for f -rings. Here, we give the pointfree versions of the Keimel and the maximal spectra for Riesz spaces. Moreover, we briefly mention ho...

We introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex optimization. We prove that our condition is weaker than all existing constraint qualifications, including the closed epigraph condition. Our dual condition was inspired by, and is weaker than, the so-called Bertsekas’ condition for monotropic programming problems. We give several corollaries of...

Uncertainty theory is a branch of mathematics based on normality, monotonicity, self-duality, countable subadditivity, and product measure axioms. Different from randomness and fuzziness, uncertainty theory provides a new mathematical model for uncertain phenomena. A key concept to describe uncertain quantity is uncertain variable, and expected value operator provides an average value of uncert...

convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...

let $x$ be a sufficiently nice scheme. we survey some recent progress on dualizing complexes. it turns out that a complex in $kinj x$ is dualizing if and only if tensor product with it induces an equivalence of categories from murfet's new category $kmpr x$ to the category $kinj x$. in these terms, it becomes interesting to wonder how to glue such equivalences.

In relation to the vector optimization problem v-minx∈X(f + g ◦ A)(x), with f, g proper and cone-convex functions and A : X → Y a linear continuous operator between separated locally convex spaces, we define a general vector Fenchel-type dual problem. For the primal-dual pair we prove weak, and under appropriate regularity conditions, strong and converse duality. In the particular case when the...