Searcharxiv⌕ Search

arXiv subjects

Apurba Das

Publications and source records attributed to Apurba Das.

At least 91 records · Page 5Linked to original sources

Extensions and deformations of algebras with higher derivations

Higher derivations on an associative algebra generalizes higher order derivatives. We call a tuple consisting of an algebra and a higher derivation on it by an AssHDer pair. We define a cohomology for AssHDer pairs with coefficients in a representation. Next, we study central extensions, abelian extensions of AssHDer pairs and relate them to the second cohomology group with appropriate coefficients. Deformations of AssHDer pairs are also considered which are governed by the cohomology with self coefficient.

math.RA↗

Shared-Memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs

Maximal Clique Enumeration (MCE) is a fundamental graph mining problem, and is useful as a primitive in identifying dense structures in a graph. Due to the high computational cost of MCE, parallel methods are imperative for dealing with large graphs. We present shared-memory parallel algorithms for MCE, with the following properties: (1) the parallel algorithms are provably work-efficient relative to a state-of-the-art sequential algorithm (2) the algorithms have a provably small parallel depth, showing they can scale to a large number of processors, and (3) our implementations on a multicore machine show good speedup and scaling behavior with increasing number of cores, and are substantially faster than prior shared-memory parallel algorithms for MCE; for instance, on certain input graphs, while prior works either ran out of memory or did not complete in 5 hours, our implementation finished within a minute using 32 cores. We also present work-efficient parallel algorithms for maintaining the set of all maximal cliques in a dynamic graph that is changing through the addition of edges.

cs.DC↗

On equivariant dendriform algebras

Dendriform algebras are certain associative algebras whose product splits into two binary operations and the associativity splits into three new identities. In this paper, we study finite group actions on dendriform algebras. We define equivariant cohomology for dendriform algebras equipped with finite group actions similar to the Bredon cohomology for topological $G$-spaces. We show that equivariant cohomology of such dendriform algebras controls equivariant one-parameter formal deformations.

math.RA↗

Gerstenhaber algebra structure on the cohomology of a hom-associative algebra

A hom-associative algebra is an algebra whose associativity is twisted by an algebra homomorphism. In this paper, we define a cup product on the cohomology of a hom-associative algebra. We show that the cup product together with the degree $-1$ graded Lie bracket (which controls the deformation of the hom-associative algebra structure) on the cohomology forms a Gerstenhaber algebra. This generalizes a classical fact that the Hochschild cohomology of an associative algebra carries a Gerstenhaber algebra structure.

math.RA↗

Cohomology and deformations of dendriform algebras, and $\mathrm{Dend}_\infty$-algebras

A dendriform algebra is an associative algebra whose product splits into two binary operations and the associativity splits into three new identities. These algebras arise naturally from some combinatorial objects and through Rota-Baxter operators. In this paper, we start by defining cohomology of dendriform algebras with coefficient in a representation. The deformation of a dendriform algebra $A$ is governed by the cohomology of $A$ with coefficient in itself. Next we study $\mathrm{Dend}_\infty$-algebras (dendriform algebras up to homotopy) in which the dendriform identities hold up to certain homotopy. They are certain splitting of $A_\infty$-algebras. We define Rota-Baxter operator on $A_\infty$-algebras which naturally gives rise to $\mathrm{Dend}_\infty$-algebras. Finally, we classify skeletal and strict $\mathrm{Dend}_\infty$-algebras.

math.RA↗

Crossed extensions of Lie algebras

It is known that Hochschild cohomology groups are represented by crossed extensions of associative algebras. In this paper, we introduce crossed $n$-fold extensions of a Lie algebra $\mathfrak{g}$ by a module $M$, for $n \geq 2$. The equivalence classes of such extensions are represented by the $(n+1)$-th Chevalley-Eilenberg cohomology group $H^{n+1}_{CE} (\mathfrak{g}, M).$

math.RA↗

Contact Courant algebroids and $L_\infty$-algebras

Let $L$ be a line bundle over $M$. In this paper we associate an $L_\infty$-algebra to any $L$-Courant algebroid (contact Courant algebroid in the sense of Grabowski). This construction is similar to the work of Roytenberg and Weinstein for Courant algebroids. Next we associate a $p$-term $L_\infty$-algebra to any isotropic involutive subbundle of $(\mathbb{D}L)^p := DL \oplus (\wedge^p (DL)^* \otimes L)$, where $DL$ is the gauge algebroid of $L$. In a particular case, we relate these $L_\infty$-algebras by a suitable morphism.

math.DG↗

Homotopy G-algebra structure on the cochain complex of hom-type algebras

A hom-associative algebra is an algebra whose associativity is twisted by an algebra homomorphism. We show that the Hochschild type cochain complex of a hom-associative algebra carries a homotopy G-algebra structure. As a consequence, we get a Gerstenhaber algebra structure on the cohomology of a hom-associative algebra. We also find similar results for hom-dialgebras.

math.RA↗

Hom-associative algebras up to homotopy

A hom-associative algebra is an algebra whose associativity is twisted by an algebra homomorphism. In this paper, we introduce a strongly homotopy version of hom-associative algebras ($HA_\infty$-algebras in short) on a graded vector space. We describe $2$-term $HA_\infty$-algebras in details. In particular, we study 'skeletal' and 'strict' $2$-term $HA_\infty$-algebras. We also introduce hom-associative $2$-algebras as categorification of hom-associative algebras. The category of $2$-term $HA_\infty$-algebras and the category of hom-associative $2$-algebras are shown to be equivalent. An appropriate skew-symmetrization of $HA_\infty$-algebras give rise to $HL_\infty$-algebras introduced by Sheng and Chen. Finally, we define a suitable Hochschild cohomology theory for $HA_\infty$-algebras which control the deformation of the structures.

math.RA↗

Enumerating Top-k Quasi-Cliques

Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of cliques. Enumerating quasi-cliques from a graph is a robust way to detect densely connected structures with applications to bio-informatics and social network analysis. However, enumerating quasi-cliques in a graph is a challenging problem, even harder than the problem of enumerating cliques. We consider the enumeration of top-k degree-based quasi-cliques, and make the following contributions: (1) We show that even the problem of detecting if a given quasi-clique is maximal (i.e. not contained within another quasi-clique) is NP-hard (2) We present a novel heuristic algorithm KernelQC to enumerate the k largest quasi-cliques in a graph. Our method is based on identifying kernels of extremely dense subgraphs within a graph, following by growing subgraphs around these kernels, to arrive at quasi-cliques with the required densities (3) Experimental results show that our algorithm accurately enumerates quasi-cliques from a graph, is much faster than current state-of-the-art methods for quasi-clique enumeration (often more than three orders of magnitude faster), and can scale to larger graphs than current methods.

cs.DS↗

Shared-Memory Parallel Maximal Clique Enumeration

We present shared-memory parallel methods for Maximal Clique Enumeration (MCE) from a graph. MCE is a fundamental and well-studied graph analytics task, and is a widely used primitive for identifying dense structures in a graph. Due to its computationally intensive nature, parallel methods are imperative for dealing with large graphs. However, surprisingly, there do not yet exist scalable and parallel methods for MCE on a shared-memory parallel machine. In this work, we present efficient shared-memory parallel algorithms for MCE, with the following properties: (1) the parallel algorithms are provably work-efficient relative to a state-of-the-art sequential algorithm (2) the algorithms have a provably small parallel depth, showing that they can scale to a large number of processors, and (3) our implementations on a multicore machine shows a good speedup and scaling behavior with increasing number of cores, and are substantially faster than prior shared-memory parallel algorithms for MCE.

cs.DS↗

Gauge transformations of Jacobi structures and contact groupoids

We define gauge transformations of Jacobi structures on a manifold. This is related to gauge transformations of Poisson structures via the Poissonization. Finally, we discuss how the contact structure of a contact groupoid is effected by a gauge transformation of the Jacobi structure on its base.

math-ph↗

Incremental Maintenance of Maximal Cliques in a Dynamic Graph

We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the magnitude of change in the set of maximal cliques, as well as the first change-sensitive algorithms for clique maintenance, whose runtime is proportional to the magnitude of the change in the set of maximal cliques. We present experimental results showing these algorithms are efficient in practice and are faster than prior work by two to three orders of magnitude.

cs.DS↗

Reduction of Nambu-Poisson manifolds by regular distributions

The version of Marsden-Ratiu reduction theorem for Nambu-Poisson manifolds by a regular distribution has been studied by Ib$\acute{\text{a}}\tilde{\text{n}}$ez et al. In this paper we show that the reduction is always ensured unless the distribution is zero. Next we extend the more general Falceto-Zambon Poisson reduction theorem for Nambu-Poisson manifolds. Finally, we define gauge transformations of Nambu-Poisson structures and show that these transformations commute with the reduction procedure.

math.DG↗

Nambu Structures And Associated Bialgebroids

This paper investigates higher order generalizations of well known results for Lie algebroids and bialgebroids. It is proved that $n$-Lie algebroid structures correspond to $n$-ary generalization of Gerstenhaber algebras and are implied by $n$-ary generalization of linear Poisson structures on the dual bundle. A Nambu-Poisson manifold (of order $n>2$) gives rise to a special bialgebroid structure which is referred to as a weak Lie-Filippov bialgebroid (of order $n$). It is further demonstrated that such bialgebroids canonically induce a Nambu-Poisson structure on the base manifold. Finally, the tangent space of a Nambu Lie group gives an example of a weak Lie-Filippov bialgebroid over a point.

math.DG↗

Nambu structures on Lie algebroids and their modular classes

We introduce the notion of the modular class of a Lie algebroid equipped with a Nambu structure. In particular, we recover the modular class of a Nambu-Poisson manifold $M$ with its Nambu tensor $Λ$ as the modular class of the tangent Lie algebroid $TM$ with Nambu structure $Λ.$ We show that many known properties of the modular class of a Nambu-Poisson manifold that of a Lie algebropid extend to the setting of a Lie algebroid with Nambu structure. Finally, we prove that for a large class of Nambu-Poisson manifolds considered as tangent Lie algebroids with Nambu structures, the associated modular classes are closely related to Evens-Lu-Weinstein modular classes of Lie algebroids.

math.DG↗

Poisson-Nijenhuis groupoids

We define multiplicative Poisson-Nijenhuis structures on a Lie groupoid which extends the notion of symplectic-Nijenhuis groupoid introduced by Stié23non and Xu. We also introduce a special class of Lie bialgebroid structure on a Lie algebroid $A$, called P-N Lie bialgebroid, which defines a hierarchy of compatible Lie bialgebroid structures on $A$. We show that under some topological assumption on the groupoid, there is a one-to-one correspondence between multiplicative Poisson-Nijenhuis structures on a Lie groupoid and P-N Lie bialgebroid structures on the corresponding Lie algebroid.

math.DG↗

A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph

We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph changes, we are interested in knowing the change in the set of maximal bicliques (the "change"), rather than in knowing the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without explicitly enumerating the set of all maximal bicliques. In this work, we present (1) near-tight bounds on the magnitude of change in the set of maximal bicliques of a graph, due to a change in the edge set (2) a "change-sensitive" algorithm for enumerating the change in the set of maximal bicliques, whose time complexity is proportional to the magnitude of change that actually occurred in the set of maximal bicliques in the graph. To our knowledge, these are the first algorithms for enumerating maximal bicliques in a dynamic graph, with such provable performance guarantees. Our algorithms are easy to implement, and experimental results show that their performance exceeds that of current baseline implementations by orders of magnitude.

cs.DS↗