Fonctions de Green-Riemann holomorphes: I - Opérateurs à coefficients constants

In this article, we define holomorphic Green functions for constant coefficients operators, and define inverses of the operator using Cauchy-Fantappié-Leray formula.     

On optimization problems with set-valued objective maps

In this paper, we consider constrained optimization problems with set-valued objective maps. First, we define three types of quasi orderings on the set of all non-empty subsets in n-dimensional Euclidean space and investigate their properties. Next, by using these orderings, we define the concepts of the convexities to set-valued maps and investigate their properties. Finally, based on these results, we define the concepts of optimal solutions to constrained optimization problems with set-valued objective maps and characterize their properties.     

q-Hardy-Berndt type sums associated with q-Genocchi type zeta and q-l-functions

The aim of this paper is to define new generating functions. By applying a derivative operator and the Mellin transformation to these generating functions, we define q-analogue of the Genocchi zeta function, q-analogue Hurwitz type Genocchi zeta function, and q-Genocchi type l-function. We define partial zeta function. By using this function, we construct p-adic interpolation functions which interpolate generalized q-Genocchi numbers at negative integers. We also define p-adic meromorphic functions on C_p. Furthermore, we construct new generating functions of q-Hardy-Berndt type sums and q-Hardy-Berndt type sums attached to Dirichlet character. We also give some new relations, related to these sums.     

On Optimization Problems with Set-Valued Objective Maps: Existence and Optimality

In this paper, we consider constrained optimization problems with set-valued objective maps. First, we define three types of quasi orderings on the set of all non-empty subsets of n-dimensional Euclidean space. Second, by using these quasi orderings, we define the concepts of lower semi-continuity for set-valued maps and investigate their properties. Finally, based on these results, we define the concepts of optimal solutions to constrained optimization problems with set-valued objective maps and we give some conditions under which these optimal solutions exist to the problems and give necessary and sufficient conditions for optimality.     

Commutator Calculus for Wreath Product Groups

We introduce a class of function spaces consisting of integer-valued functions of several integers which coordinatize the elements of certain subgroups of some finite regular wreath product groups. On each function space, we define operators which correspond to forming certain commutators relevent to computing the upper central series. We define an automorphism of the function space which enables us to define a class of subgroups that is useful for describing the upper central series of certain finite regular wreath product p-groups. Our results describe fundamental, interesting, and useful relationships between the automorphism and the operators. We describe some applications.     

Affine Pólya-Szegö inequality on Steiner rearrangement in any codimension

The affine Polya-Szego inequality on the Steiner rearrangement in any codimension is proved. We not only define k-Orlicz-Sobolev ball on Sobolev functions and prove corresponding affine Polya-Szego inequality, but also define k-Orlicz-Sobolev ball on functions of bounded variation and prove the corresponding affine Polya-Szego inequality.

     

On the notion of canonical dimension for algebraic groups

We define and study a numerical invariant of an algebraic group action which we call the canonical dimension. We then apply the resulting theory to the problem of computing the minimal number of parameters required to define a generic hypersurface of degree d in P^n-1.     

New notions in derived categories of local rings

In the derived category of a local commutative noetherian ring, we define irreducible chain complexes, atomic chain complexes, minimal atomic chain complexes and chain complexes having no mod m detectable homology. Also, we define nuclear chain complexes and core of chain complexes. After defining these notions, we establish the connection between them.     

Binary games in constitutional form and collective choice

In this paper, we define the notion of binary game in constitutional form. For this game, we define a core and give a necessary and sufficient condition for a game to be stable.We define a representation of a collective choice rule by a binary game in constitutional form and characterize those collective choice rules which are representable.We finally introduce the notion of c-social decision function and characterize, as an application of our theorem on stability of binary constitutional games, the collective choice rules which are c-social decision functions.Our representation of a collective choice rule by a binary game in constitutional form is an obvious improvement of the classical representation by a simple game.     

Intégrales Hilbertiennes anticipantes par rapport à un processus de Wiener cylindrique et calcul stochastique associé

We define the Skorohod integral of an operator-valued process with respect to a cylindrical Hilbertian Wiener process. We study the resulting process, and establish a generalized Itô formula. We define also a Stratonovitch integral, and establish the corresponding chain rule. Our work is inspired by the finite-dimensional results in [10].     

KKM mappings in cone metric spaces and some fixed point theorems

In this paper, we define KKM mappings in cone metric spaces and define Nℜ-cone metric spaces to obtain some fixed point theorems and hence generalize the results obtained in [A. Amini, M. Fakhar, J. Zafarani, KKM mapping in metric spaces, Nonlinear Anal. 60 (2005) 1045-1052].     

Dirac cohomology of the Dunkl-Opdam subalgebra via inherited Drinfeld properties

Abstract

In this paper, we define a new presentation for the Dunkl-Opdam subalgebra of the rational Cherednik algebra. This presentation uncovers the Dunkl-Opdam subalgebra as a Drinfeld algebra. We use this fact to define Dirac cohomology for the DO subalgebra. We also formalize generalized graded Hecke algebras and extend a Langlands classification to generalized graded Hecke algebras.     

Global analytic geometry

Motivated by the well-known lack of archimedean information in algebraic geometry, we define, formalizing Ostrowski's classification of seminorms on Z, a new type of valuation of a ring that combines the notion of Krull valuation with that of a multiplicative seminorm. This definition partially restores the broken symmetry between archimedean and non-archimedean valuations artificially introduced in arithmetic geometry by the theory of schemes. This also allows us to define a notion of global analytic space that reconciles Berkovich's notion of analytic space of a (Banach) ring with Huber's notion of non-archimedean analytic spaces. After defining natural generalized valuation spectra and computing the spectrum of Z and Z[X], we define analytic spectra and sheaves of analytic functions on them.     

The fundamental Gray 3-groupoid of a smooth manifold and local 3-dimensional holonomy based on a 2-crossed module

We define the thin fundamental Gray 3-groupoid S₃(M) of a smooth manifold M and define (by using differential geometric data) 3-dimensional holonomies, to be smooth strict Gray 3-groupoid maps S₃(M)→C(H), where H is a 2-crossed module of Lie groups and C(H) is the Gray 3-groupoid naturally constructed from H. As an application, we define Wilson 3-sphere observables.     

Groupes fondamentaux motiviques de Tate mixte

We define the category of mixed Tate motives over the ring of S-integers of a number field. We define the motivic fundamental group (made unipotent) of a unirational variety over a number field. We apply this to the study of the motivic fundamental group of the projective line punctured at zero, infinity and all Nth roots of unity.     

Weyl transforms associated with the Hankel transform in Clifford analysis

In this paper, we define the Hankel–Wigner transform in Clifford analysis and therefore define the corresponding Weyl transform. We present some properties of this kind of Hankel–Wigner transform, and then give the criteria of the boundedness of the Weyl transform and compactness on the L^p space. Copyright © 2005 John Wiley & Sons, Ltd.     

On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables

ABSTRACT

We define and discuss different enumerative methods to compute solutions of generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables. We propose both branch-and-bound methods based on merit functions for the mixed-integer game, and branch-and-prune methods that exploit the concept of dominance to make effective cuts. We show that under mild assumptions the equilibrium set of the game is finite and we define an enumerative method to compute the whole of it. We show that our branch-and-prune method can be suitably modified in order to make a general equilibrium selection over the solution set of the mixed-integer game. We define an application in economics that can be modelled as a Nash game with linear coupling constraints and mixed-integer variables, and we adapt the branch-and-prune method to efficiently solve it.     

The correlation numerical range of a matrix and Connes’ embedding problem

We define a new numerical range of an $n\times n$ complex matrix in terms of correlation matrices and develop some of its properties. We also define a related numerical range that arises from Connes’ famous embedding problem.     

On Nondeterminism,Enumeration Reducibility and Polynomial Bounds

Enumeration reducibility is a notion of relative computability between sets of natural numbers where only positive information about the sets is used or produced. Extending e-reducibility to partial functions characterises relative computability between partial functions. We define a polynomial time enumeration reducibility that retains the character of enumeration reducibility and show that it is equivalent to conjunctive non-deterministic polynomial time reducibility. We define the polynomial time e-degrees as the equivalence classes under this reducibility and investigate their structure on the recursive sets, showing in particular that the pe-degrees of the computable sets are dense and do not form a lattice, but that minimal pairs exist. We define a jump operator and use it to produce a characterisation of the polynomial hierarchy.