Related papers: Telescoping Algorithms for $\Sigma^*$-Extensions v…
We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which…
We generalize a result of Serre's to show that if every vertex of some fixed type of a convex subcomplex of an irreducible spherical building has an opposite, then the subcomplex is completely reducible.
In recent years, the expander decomposition method was used to develop many graph algorithms, resulting in major improvements to longstanding complexity barriers. This powerful hammer has led the community to (1) believe that most problems…
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
In this paper, we introduce telescoping continued fractions to find lower bounds for the error term $r_n$ in Stirling's approximation $\displaystyle n! = \sqrt{2\pi}n^{n+1/2}e^{-n}e^{r_n}.$ This improves lower bounds given earlier by…
Let $M$, $N$, $R$ be $W^{*}$--algebras, with $R$ unitally embedded in both $M$ and $N$. by using Reduction Theory, we extend the previous description of the $W^{*}$--tensor product $M\bar\otimes_{R}N$ over the common $W^{*}$--subalgebra $R$…
In this paper, we introduce the framework of a generalized design, which represents any linear operator as a finite sum of local linear maps attached to finitely many points, thereby abstracting the core of design theory without employing…
In this paper we present new structural information about the multiplier algebra Mult (A) of a sigma-unital purely infinite simple C*-algebra A, by characterizing the positive elements a in Mult(A) that are strict sums of projections…
We consider the problem of atmospheric tomography, as it appears for example in adaptive optics systems for extremely large telescopes. We derive a frame decomposition, i.e., a decomposition in terms of a frame, of the underlying…
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a…
We prove a reduction theorem for capacity of positive maps of finite dimensional C*-algebras, thus reducing the computation of capacity to the case when the image of a nonscalar projection is never a projection.
To study coisotropic reduction in the context of deformation quantization we introduce constraint manifolds and constraint algebras as the basic objects encoding the additional information needed to define a reduction. General properties of…
We propose a new reconstruction method for scalar--tensor gravity based on the use of conformal transformations. The new method allows the derivation of a set of interesting exact cosmological solutions in brans Dicke gravity as well as…
This article describes the REDUCE package ZEILBERG implemented by Gregor St\"olting and the author. The REDUCE package ZEILBERG is a careful implementation of the Gosper and Zeilberger algorithms for indefinite, and definite summation of…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
Symmetry reduction is a well-known approach for alleviating the state explosion problem in model checking. Automatically identifying symmetries in concurrent systems, however, is computationally expensive. We propose a symbolic framework…
Summability has been a central object of study in difference algebra over the past half-century. It serves as a cornerstone of algebraic methods to study linear recurrences over various fields of coefficients and with respect to various…
The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem. We observe that the previously known method for showing that…