Related papers: Congruences on infinite partition and partial Brau…

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

We define and study a family of partitions of the wonderful compactification \bar{G} of a semi-simple algebraic group G of adjoint type. The partitions are obtained from subgroups of G \times G associated to triples (A_1, A_2, a), where A_1…

We present a novel approach to the construction of new finite algebras and describe the congruence lattices of these algebras. Given a finite algebra $(B_0, \dots)$, let $B_1, B_2, \dots, B_K$ be sets that either intersect $B_0$ or…

Expanding a result of Serre on finite CW-complexes, we show that the Brauer group coincides with the cohomological Brauer group for arbitrary compact spaces. Using results from the homotopy theory of classifying spaces for Lie groups, we…

The monomer-dimer model is fundamental in statistical mechanics. However, it is $#P$-complete in computation, even for two dimensional problems. A formulation in matrix permanent for the partition function of the monomer-dimer model is…

Let $k$ be a field that is finitely generated over the field of rational numbers and $Br(k)$ the Brauer group of $k$. Let $X$ be an absolutely irreducible smooth projective variety over $k$, let $Br(X)$ be the cohomological…

We prove some new cases of real appoximation for homogeneous spaces with finite stabilizers and describe the state of the art around this question, giving proofs that are well-known to experts but that, to our knowledge, cannot be found in…

We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

Inspired by a planar partitioning problem involving multiple improper chambers, this article investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint…

Let X be a proper smooth and connected surface over a finite field. We proved in [LLR2] that the order of the Brauer group Br(X) of X is a perfect square if it is finite. Our proof is based in part on a result of Gordon [Gor], which we used…

We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of…

A \textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism…

The present thesis studies structural properties of non-crossing partitions associated to finite Coxeter groups from both algebraic and geometric perspectives. On the one hand, non-crossing partitions are lattices, and on the other hand, we…

Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…

We characterize the convergence spaces $(X,\xi)$ such that the space of points of $(\mathbb{P}X,\lim_{\xi})$ in the category of convergence lattices is $(X,\xi)$. On the way, we study variants of sobriety and of the axiom $T_{D}$ in…

In this paper it is shown how to construct a finite topological space $X$ for a given finitely presentable group $G$ such that $\pi_1(X)\cong G$. Our construction is not optimal in the sense that the cardinality of the space $X$ might not…

We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…

Approximate lattices are aperiodic generalisations of lattices of locally compact groups that were first studied in seminal work of Yves Meyer. They are defined as those uniformly discrete approximate subgroups (symmetric subsets stable…

We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…