Related papers: Cohomology in Grothendieck Topologies and Lower Bo…
This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from…
Following the classical results of Stong, we introduce a cohomological analogue of a core of a finite sheaved topological space and propose an algorithm for simplification in this category. In particular we generalize the notion of beat…
We initiate the study of sheaves on Cech closure spaces, providing a new, unified approach to sheaf theory on many of the major classes of spaces of interest to applications: topological spaces, finite simplicial complexes (seen as $T_0$…
We study the cohomology of the free loop space of $SU(n+1)/T^n$, the simplest example of a complete flag manifolds and an important homogeneous space. Through this enhanced analysis we reveal rich new combinatorial structures arising in the…
Given an abelian category $\mathcal{A}$ with enough injectives we show that a short exact sequence of chain complexes of objects in $\mathcal{A}$ gives rise to a short exact sequence of Cartan-Eilenberg resolutions. Using this we construct…
We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely computing only low degree polynomials homomorphically, but this…
To a coarse structure we associate a Grothendieck topology which is determined by coarse covers. A coarse map between coarse spaces gives rise to a morphism of Grothendieck topologies. This way we define sheaves and sheaf cohomology on…
We model problems as presheaves that assign sets of certificates to input instances, and we show how to use presheaf \v{C}ech cohomology to capture the precise ways in which local solutions fail to patch into global ones. Applied to…
We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…
The immensely fruitful concept of Grothendieck topology or covering issued from the efforts of algebraic geometers to study "sheaf-like" objects defined on categories more general than the lattice of open sets on a topological space. In the…
In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
Recently, Chach\'olski, Neeman, Pitsch, and Scherer studied, in a series of three papers, model approximations for the unbounded category of cochain complexes over a commutative ring. These approximations allow to construct relative…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
This paper is a continuation of ``Operads, Grothendieck topologies and deformation theory'' (alg-geom/9502010). We show how to develop a cohomology theory that would control deformations of a sheaf of associative algebras over a scheme by…
Given a real dataset and a computation family, we wish to encode and store the dataset in a distributed system so that any computation from the family can be performed by accessing a small number of nodes. In this work, we focus on the…
We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…
We highlight a general theory to engineer arbitrary Hermitian tight-binding lattice models in electrical LC circuits, where the lattice sites are replaced by the electrical nodes, connected to its neighbors and to the ground by capacitors…
We develop theory of (possibly large) cotilting objects of injective dimension at most one in general Grothendieck categories. We show that such cotilting objects are always pure-injective and that they characterize the situation where the…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…