相关论文: A homotopical algebra approach to the computation …
Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…
Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite presentations and resolutions. Centrally at issue…
It is well known that limits can be computed by restricting along an initial functor, and that this often simplifies limit computation. We systematically study the algorithmic implications of this idea for diagrams indexed by a finite…
A lot of well-known functors such as group homology, cyclic homology of algebras can be described as limits of certain simply defined functors over categories of presentations. In this paper, we develop technique for the description of the…
We study the higher derived functors of the inverse limit of a functor F: D --> Z_{(p)}-mod, where D is one of the standard categories which arise when studying the homotopy theory of the classifying space of a finite group G, e.g., the…
The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…
We prove new vanishing results on the growth of higher torsion homologies for suitable arithmetic lattices, Artin groups and mapping class groups. The growth is understood along Farber sequences, in particular, along residual chains. For…
We develop a formalism for constructing stochastic upper bounds on the expected full sample risk for supervised classification tasks via the Hilbert coresets approach within a transductive framework. We explicitly compute tight and…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
The purpose of this paper is twofold. 1. We give combinatorial bounds on the ranks of the groups $\Tor^{R}_\bullet(k,k)_\bullet$ in the case where $R = k[\Lambda]$ is an affine semi-group ring, and in the process provide combinatorial…
Using ambient space we develop a fully gauge and o(d,2) covariant approach to boundary values of AdS(d+1) gauge fields. It is applied to the study of (partially) massless fields in the bulk and (higher-order) conformal scalars, i.e.…
Many problems in robotics involve both continuous and discrete components, and modeling them together for estimation tasks has been a long standing and difficult problem. Hybrid Factor Graphs give us a mathematical framework to model these…
The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…
Garland introduced a vanishing criterion for a characteristic zero cohomology group of a locally finite and locally connected simplicial complex. The criterion is based on the spectral gaps of the graph Laplacians of the links of faces and…
A theory of higher colimits over categories of free presentations is developed. It is shown that different homology functors such as Hoshcshild and cyclic homology of algebras over a field of characteristic zero, simplicial derived…
We describe the projectives in the category of functors from a graded poset to abelian groups. Based on this description we define a related condition, pseudo-projectivity, and we prove that this condition is enough for the vanishing of the…
In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…
We prove results concerning the behavior of Hodge ideals under restriction to hypersurfaces or fibers of morphisms, and addition. The main tool is the description of restriction functors for mixed Hodge modules by means of the…
We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational…
One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of its eigenvalues. It is easily seen that the Hoffman bound…