Related papers: Two-element structures modulo primitive positive c…
We study polynomial Poisson algebras with some regularity conditions. Linear (Lie-Berezin-Kirillov) structures on dual spaces of semi-simple Lie algebras, quadratic Sklyanin elliptic algebras of \cite{FO1},\cite{FO2} as well as polynomial…
This paper studies the combinatorics of lattice congruences of the weak order on a finite Weyl group $W$, using representation theory of the corresponding preprojective algebra $\Pi$. Natural bijections are constructed between important…
We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation.…
For $n\geq 3$, let $(H_n, E)$ denote the $n$-th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on $n$ vertices. We show that for all…
This is a survey of the current state of the question "Which closed connected manifolds of dimension $n\ge 5$ admit Riemannian metrics whose scalar curvature function is everywhere positive?" The introduction gives a brief overview of these…
We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…
We investigate reflection-type problems on the class SPM, of Boolean algebras carrying strictly positive finitely additive measures. We show, in particular, that in the constructible universe there is a Boolean algebra $\mathfrak A$ which…
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, $\wedge$, $\Diamond$, and $\Box$. Previously, the only known result was that the…
We discuss the construction of robust preconditioners for finite element approximations of Biot's consolidation model in poroelasticity. More precisely, we study finite element methods based on generalizations of the Hellinger-Reissner…
Inspired by natural cellular materials such as trabecular bone, lattice structures have been developed as a new type of lightweight material. In this paper we present a novel method to design lattice structures that conform with both the…
The central open question in Descriptive Complexity is whether there is a logic that characterizes deterministic polynomial time (PTIME) on relational structures. Towards this goal, we define a logic that is obtained from first-order logic…
Motivated by the classical work of Halmos on functional monadic Boolean algebras we derive three basic sup-semilattice constructions, among other things the so-called powersets and powerset operators. Such constructions are extremely useful…
Positive modal algebras are the positive-subreducts of modal algebras. We prove that the variety of positive S4-algebras is not locally finite. On the other hand, the free one-generated positive S4-algebra is shown to be finite. Moreover,…
We develop here a simple quantisation formalism that make use of Lie algebra properties of the Poisson bracket. When the brackets $\{H,\phi_i\}$ and $\{\phi_i,\phi_j\}$, where $H$ is the Hamiltonian and $\phi_i$ are primary and secondary…
With this contribution, we give a complete and comprehensive framework for modeling the dynamics of complex mechanical structures as port-Hamiltonian systems. This is motivated by research on the potential of lightweight construction using…
We consider an ultracold dipolar Bose gas in a one-dimensional lattice. For a sufficiently large lattice recoil energy, such a system becomes a series of non-overlapping Bose-Einstein condensates that interact via the long-range…
Let $R=K[x_1,\ldots,x_m]$ where $K$ is an uncountable algebraically closed field of characteristic $0$. For a prime ideal $P$ of $R$, let $\mu_j(P,M)$ be the $j$-th Bass number of an $R$-module $M$ with respect to the prime $P$. For $1\leq…
We use the structure lattice, introduced in Part I, to undertake a systematic study of the class $\mathscr S$ consisting of compactly generated, topologically simple, totally disconnected locally compact groups that are non-discrete. Given…
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…
In this work we investigate the computational complexity of the satisfiability problem of sub-fragments of the Bernays-Schoenfinkel class of first-order logic, also known as EPR (Effectively Propositional). While Bernays-Schoenfinkel is…