Related papers: The cyclic sliding operation in Garside groups

The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of…

We define a new class of shift spaces which contains a number of classes of interest, like Sturmian shifts used in discrete geometry. We show that this class is closed under two natural transformations. The first one is called conjugacy and…

We present a formal analysis, in Isabelle/HOL, of optimisation algorithms for matroids, which are useful generalisations of combinatorial structures that occur in optimisation, and greedoids, which are a generalisation of matroids. Although…

We show that a large class of Euclidean extended supersymmetric lattice gauge theories constructed in [hep-lat/0302017 - hep-lat/0503039] can be regarded as compact formulations by using the polar decomposition of the complex link fields.…

Strongly-cyclic branched coverings of knots are studied by using their (g,1)-decompositions. Necessary and sufficient conditions for the existence and uniqueness of such coverings are obtained. It is also shown that their fundamental groups…

Garside groups are a natural lattice-theoretic generalisation of the braid groups and spherical type Artin--Tits groups. Here we show that the class of Garside groups is closed under some free products with cyclic amalgamated subgroups. We…

All crossed products of two cyclic groups are explicitly described using generators and relations. A necessary and sufficient condition for an extension of a group by a group to be a cyclic group is given.

Zimmer's superrigidity theorems on higher rank Lie groups and their lattices launched a program of study aiming to classify actions of semisimple Lie groups and their lattices, known as the {\it Zimmer program}. When the group is too large…

We give an efficient algorithm for robustly clustering of a mixture of two arbitrary Gaussians, a central open problem in the theory of computationally efficient robust estimation, assuming only that the the means of the component Gaussians…

We prove that in the Cayley graph of any braid group modulo its center $B_n/Z(B_n)$, equipped with Garside's generating set, the axes of all pseudo-Anosov braids are strongly contracting. More generally, we consider a Garside group $G$ of…

Elastic and dissipative properties of granular assemblies under uniaxial compression are studied both experimentally and by numerical simulations. Following a novel compaction procedure at varying oscillatory pressures, the stress response…

We study a two-dimensional model for interacting colloidal particles which displays spontaneous clustering. Within this model we investigate the competition between the pinning to a periodic corrugation potential, and a sideways constant…

Let $F$ be a crossing family over ground set $V$, that is, for any two sets $U,W\in{F}$ with nonempty intersection and proper union, both sets $U\cap{W},U\cup{W}$ are in $F$. Let $\sigma:V\to \{+,-\}$ be a signing. We call $\sigma$ a…

The Grassmannian admits an action by a finite cyclic group via the cyclic shift map. We give a simple description of the points fixed by each element of this cyclic group, extending Karp's description of the points fixed by the cyclic shift…

We study close-to-constants quasiperiodic cocycles in $\mathbb{T} ^{d} \times G$, where $d \in \mathbb{N} ^{*} $ and $G$ is a compact Lie group, under the assumption that the rotation in the basis satisfies a Diophantine condition. We prove…

Considering higher-order interactions allows for a more comprehensive understanding of network structures beyond simple pairwise connections. While leveraging all cliques in a network to handle higher-order interactions is intuitive, it…

This paper is to prove superconvergence of a family of simple conforming mixed finite elements of first orderfor the linear elasticity problem with the Hellinger--Reissner variational formulation. The analysis is based on three main…

In this paper, a new data structure named group-list is proposed. The group-list is as simple as the inverted index. However, the group-list divides document identifiers in an inverted index into groups, which makes it more efficient when…

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

Soft sets, as a mathematical tool for dealing with uncertainty, have recently gained considerable attention, including some successful applications in information processing, decision, demand analysis, and forecasting. To construct new soft…