A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market

We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities.Comment: Preliminary version in ICALP 201

Feasible Multivariate Nonparametric Estimation Using Weak Separability

One of the main practical problems of nonparametric regression estimation is the curse of dimensionality. The curse of dimensionality arises because nonparametric regression estimates are dependent variable averages local to the point at which the regression function is to be estimated. The number of observations `local' to the point of estimation decreases exponentially with the number of dimensions. The consequence is that the variance of unconstrained nonparametric regression estimators of multivariate regression functions is often so great that the unconstrained nonparametric regression estimates are of no practical use. In this paper I propose a new estimation method of weakly separable multivariate nonparametric regression functions. Weak separability is a weaker condition than required by other dimension--reduction techniques, although similar asymptotic variance reductions obtain. Indeed, weak separability is weaker than generalized additivity (see Hardle and Linton, 1996 and Horowitz, 1998). The proposed estimator is relatively easy to compute. Theoretical results in this paper include (i) a uniform law of large numbers for marginal integration estimators, (ii) a uniform law of large numbers for marginal summation estimators, (iii) a uniform law of large numbers for my new nonparametric regression estimator for weakly separable regression functions, (iv) both a uniform strong and weak law of large numbers for U-statistics, and (v) three central limit theorems for my nonparametric regression estimator for weakly separable regression functions.

On Integer Programming, Discrepancy, and Convolution

Integer programs with a constant number of constraints are solvable in pseudo-polynomial time. We give a new algorithm with a better pseudo-polynomial running time than previous results. Moreover, we establish a strong connection to the problem (min, +)-convolution. (min, +)-convolution has a trivial quadratic time algorithm and it has been conjectured that this cannot be improved significantly. We show that further improvements to our pseudo-polynomial algorithm for any fixed number of constraints are equivalent to improvements for (min, +)-convolution. This is a strong evidence that our algorithm's running time is the best possible. We also present a faster specialized algorithm for testing feasibility of an integer program with few constraints and for this we also give a tight lower bound, which is based on the SETH.Comment: A preliminary version appeared in the proceedings of ITCS 201

Hamiltonian cycles and subsets of discounted occupational measures

We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding particular extreme points of a certain polytope associated with the input graph. This polytope is a subset of the space of discounted occupational measures. We characterize the feasible bases of the polytope for a general input graph $G$, and determine the expected numbers of different types of feasible bases when the underlying graph is random. We utilize these results to demonstrate that augmenting certain additional constraints to reduce the polyhedral domain can eliminate a large number of feasible bases that do not correspond to Hamiltonian cycles. Finally, we develop a random walk algorithm on the feasible bases of the reduced polytope and present some numerical results. We conclude with a conjecture on the feasible bases of the reduced polytope.Comment: revised based on referees comment

Optimal Point Placement for Mesh Smoothing

We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into the generalized linear programming paradigm.Comment: 12 pages, 3 figures. A preliminary version of this paper was presented at the 8th ACM/SIAM Symp. on Discrete Algorithms (SODA '97). This is the final version, and will appear in a special issue of J. Algorithms for papers from SODA '9

Lattice points on circles, squares in arithmetic progressions and sumsets of squares

Rudin conjectured that there are never more than c N^(1/2) squares in an arithmetic progression of length N. Motivated by this surprisingly difficult problem we formulate more than twenty conjectures in harmonic analysis, analytic number theory, arithmetic geometry, discrete geometry and additive combinatorics (some old and some new) which each, if true, would shed light on Rudin's conjecture.Comment: 21 pages, preliminary version. Comments welcom