اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the density of certain languages with $p^2$ letters
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The sequence $(x_n)_{ninmathbb N} = (2,5,15,51,187,dots)$ given by the rule $x_n=(2^n+1)(2^{n-1}+1)/3$ appears in several seemingly unrelated areas of mathematics. For example, $x_n$ is the density of a language of words of length $n$ with four different letters. It is also the cardinality of the quotient of $(mathbb Z_2times mathbb Z_2)^n$ under the left action of the special linear group $mathrm{SL}(2,mathbb Z)$. In this paper we show how these two interpretations of $x_n$ are related to each other. More generally, for prime numbers $p$ we show a correspondence between a quotient of $(mathbb Z_ptimesmathbb Z_p)^n$ and a language with $p^2$ letters and words of length $n$.
قيم البحث
اقرأ أيضاً
We show that many 2-dimensional Artin groups are residually finite. This includes 3-generator Artin groups with labels $geq$ 3 where either at least one label is even, or at most one label is equal 3. As a first step towards residual finiteness we sh
ow that these Artin groups, and many more, split as free products with amalgamation or HNN extensions of finite rank free groups. Among others, this holds for all large type Artin groups with defining graph admitting an orientation, where each simple cycle is directed.
It is well-known that the Pachner graph of $n$-vertex triangulated $2$-spheres is connected, i.e., each pair of $n$-vertex triangulated $2$-spheres can be turned into each other by a sequence of edge flips for each $ngeq 4$. In this article, we study
various induced subgraphs of this graph. In particular, we prove that the subgraph of $n$-vertex flag $2$-spheres distinct from the double cone is still connected. In contrast, we show that the subgraph of $n$-vertex stacked $2$-spheres has at least as many connected components as there are trees on $lfloorfrac{n-5}{3}rfloor$ nodes with maximum node-degree at most four.
A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected admits an esse
ntially unique locally flat embedding into the 3-sphere, if it admits one at all. This can be thought of as a generalisation of the 3-dimensional Schoenflies theorem.
We address a long-standing and long-investigated problem in combinatorial topology, and break the exponential barrier for triangulations of real projective space, constructing a trianglation of $mathbb{RP}^n$ of size $e^{(frac{1}{2}+o(1))sqrt{n}{log n}}$.
In this paper, we investigate statistics on alternating words under correspondence between ``possible reflection paths within several layers of glass and ``alternating words. For $v=(v_1,v_2,cdots,v_n)inmathbb{Z}^{n}$, we say $P$ is a path within $n$
glass plates corresponding to $v$, if $P$ has exactly $v_i$ reflections occurring at the $i^{rm{th}}$ plate for all $iin{1,2,cdots,n}$. We give a recursion for the number of paths corresponding to $v$ satisfying $v in mathbb{Z}^n$ and $sum_{igeq 1} v_i=m$. Also, we establish recursions for statistics around the number of paths corresponding to a given vector $vinmathbb{Z}^n$ and a closed form for $n=3$. Finally, we give a equivalent condition for the existence of path corresponding to a given vector $v$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
