We consider an Orlicz space based cohomology for metric (measured) spaces with bounded geometry. We prove the quasi-isometry invariance for a general Young function. In the hyperbolic case, we prove that the degree one cohomology can be identified with an Orlicz-Besov function space on the boundary at infinity. We give some applications to the large scale geometry of homogeneous spaces with neg...

In this report, we propose a new partitioned variable metric method for minimizing nonsmooth partially separable functions. After a short introduction, the complete algorithm is introduced and some implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Computational experiments given confirm efficiency and robustness of the new met...

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of a fixed dimension. The algorithm is based on the formula relating the kth coefficient of the Ehrhart quasi-polynomial of a rational polytope to volumes of se...

We study the critical dissipative quasi-geostrophic equations in R with arbitrary H initial data. After showing certain decay estimate, a global well-posedness result is proved by adapting the method in [10]. A decay in time estimate for higher Sobolev norms of solutions is also discussed.

This paper introduces quasi-aggregative games and establishes conditions under which such games admit a best-reply potential. This implies existence of a pure strategy Nash equilibrium without any convexity or quasi-concavity assumptions. It also implies convergence of best-reply dynamics under some additional assumptions. Most of the existing literature’s aggregation concepts are special cases...

Given relatively prime positive integers a1, . . . , an, the Frobenius number is the largest integer that cannot be written as a nonnegative integer combination of the ai. We examine the parametric version of this problem: given ai = ai(t) as functions of t, compute the Frobenius number as a function of t. A function f : Z+ → Z is a quasi-polynomial if there exists a period m and polynomials f0...

We show that enumerating all minimal spanning and connected subsets of a given matroid can be solved in incremental quasipolynomial time. In the special case of graphical matroids, we improve this complexity bound by showing that all minimal 2-vertex connected edge subsets of a given graph can be generated in incremental polynomial time.

If G is either a connected Lie group, or a finitely generated solvable group with exponential growth, we show that G contains a quasi-isometrically embedded free sub-semigroup on 2 generators.