Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Counting Coxeter’s friezes over a finite field via moduli spaces
View through CrossRef
We count the number of Coxeter’s friezes over a finite field. Our method uses geometric realizations of the spaces of friezes in a certain completion of the classical moduli space
ℳ
0
,
n
allowing repeated points in the configurations. Counting points in the completed moduli space over a finite field is related to the enumeration problem of counting partitions of cyclically ordered set of points into subsets containing no consecutive points. In the appendix we provide an elementary solution for this enumeration problem.
Title: Counting Coxeter’s friezes over a finite field via moduli spaces
Description:
We count the number of Coxeter’s friezes over a finite field.
Our method uses geometric realizations of the spaces of friezes in a certain completion of the classical moduli space
ℳ
0
,
n
allowing repeated points in the configurations.
Counting points in the completed moduli space over a finite field is related to the enumeration problem of counting partitions of cyclically ordered set of points into subsets containing no consecutive points.
In the appendix we provide an elementary solution for this enumeration problem.
Related Results
A Touch of Space Weather - Outreach project for visually impaired students
A Touch of Space Weather - Outreach project for visually impaired students
<p><em><span data-preserver-spaces="true">'A Touch of Space Weather' is a project that brings space weather science into...
Prediction of Flexible Pavement Layer Moduli from Dynaflect and FWD Deflections
Prediction of Flexible Pavement Layer Moduli from Dynaflect and FWD Deflections
Analytical investigations of Dynaflect and falling weight deflectometer (FWD) were performed using a linear elastic multilayer computer program (BISAR) to generate deflections for ...
Conjugacy of Coxeter Elements
Conjugacy of Coxeter Elements
For a Coxeter group $(W,S)$, a permutation of the set $S$ is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first l...
On hyperbolic Coxeter n-polytopes with n + 2 facets
On hyperbolic Coxeter n-polytopes with n + 2 facets
Abstract
A convex polytope admits a Coxeter decomposition if it is tiled by finitely many Coxeter polytopes such that any two tiles having a common facet are symmetr...
Combinatorial links between quasisymmetric functions and tableaux for Coxeter groups.
Combinatorial links between quasisymmetric functions and tableaux for Coxeter groups.
Liens combinatoires entre fonctions quasisymétriques et tableaux dans les groupes de Coxeter.
L'algèbre des fonctions symétriques est un outil majeur de la combinat...
Increasing familiarity with the heartbeat counting task does not affect performance
Increasing familiarity with the heartbeat counting task does not affect performance
Background: Interoception is typically defined as the processing and perception of internal signals. A common evaluation of interoceptive abilities is via the perception of heartbe...
Fully commutative elements and lattice walks
Fully commutative elements and lattice walks
An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. These el...
Friezes and continuant polynomials with parameters
Friezes and continuant polynomials with parameters
Frieze patterns (in the sense of Conway and Coxeter) are related to cluster algebras of type A and to signed continuant polynomials. In view of studying certain classes of cluster ...