Related papers: A fast coset-translation algorithm for computing t…
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree…
This article introduces a method, which starting from simple and quite general mathematical data, allows to construct linear algebras of operators which are, each of them, endowed with a bialgebra structure (coproduct and counity). Moreover…
Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set Programming (ASP) providing means for reasoning over answer sets within the language. This richer formalism comes at the price of higher computational…
We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…
A measurable relation algebra is a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the "size" of each such atom can be defined in an intuitive and reasonable way (within the framework…
Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted…
In a recent article we introduced a mechanism for producing a presentation of the descent algebra of the symmetric group as a quiver with relations, the mechanism arising from a new construction of the descent algebra as a homomorphic image…
We describe a positive characteristic analogue of the Kazhdan-Lusztig basis of the Hecke algebra of a crystallographic Coxeter system and investigate some of its properties. Using Soergel calculus we describe an algorithm to calculate this…
We show a method in constructing algebraic cycles via intersection theory. It leads to a proof of the Lefschetz standard conjecture.
This note discusses the cyclic cohomology of a left Hopf algebroid ($\times_A$-Hopf algebra) with coefficients in a right module-left comodule, defined using a straightforward generalisation of the original operators given by Connes and…
We give a construction of cyclic cocycles on convolution algebras twisted by gerbes over discrete translation groupoids. For proper \'etale groupoids, Tu and Xu provide a map between the periodic cyclic cohomology of a gerbe-twisted…
This set of theories presents a formalisation in Isabelle/HOL+Isar of data dependencies between components. The approach allows to analyse system structure oriented towards efficient checking of system: it aims at elaborating for a concrete…
Answer Set Programming (ASP) is a problem modeling and solving framework for several problems in KR with growing industrial applications. Also for studies of computational complexity and deeper insights into the hardness and its sources,…
The goal of this paper is to open up a new research direction aimed at understanding the power of preprocessing in speeding up algorithms that solve NP-hard problems exactly. We explore this direction for the classic Feedback Vertex Set…
The aim of this paper is to transfer the restrictedness theory to Hom-Lie algebras. The concept of restricted Hom-Lie algebras which is introduced in \cite{BM2} will be used in this paper. First, the existence of $p$-structures on a Hom-Lie…
Recently the authors and J.M. Kress presented a special function recurrence relation method to prove quantum superintegrability of an integrable 2D system that included explicit constructions of higher order symmetries and the structure…
Efficient computation of shortest cycles which form a homology basis under $\mathbb{Z}_2$-additions in a given simplicial complex $\mathcal{K}$ has been researched actively in recent years. When the complex $\mathcal{K}$ is a weighted graph…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…
We study the structure algebra $\mathcal{Z}$ of the stable moment graph for the case of the affine root system $A_{1}$. The structure algebra $\mathcal{Z}$ is an algebra over a symmetric algebra and in particular, it is a module over a…
In this paper, we study the following problem of reconstructing a simple polygon: Given a cyclically ordered vertex sequence of an unknown simple polygon P of n vertices and, for each vertex v of P, the sequence of angles defined by all the…