ﻻ يوجد ملخص باللغة العربية
We first enumerate a generalization of domino towers that was proposed by Tricia M. Brown (J. Integer Seq. 20 (2017)), which we call S-omino towers. We establish equations that the generating function must satisfy and then apply the Lagrange inversion formula to find a closed formula for the number of towers. We also show a connection to generalized Dyck paths and provide an explicit bijection. Finally, we consider the set of row-convex k-omino towers, introduced by Brown, and calculate an exact generating function.
We consider the relationship between the Laplacians on two sequences of planar graphs, one from the theory of self-similar groups and one from analysis on fractals. By establishing a spectral decimation map between these sequences we give an elementa
A cyclic permutation $pi:{1, dots, N}to {1, dots, N}$ has a emph{block structure} if there is a partition of ${1, dots, N}$ into $k otin{1,N}$ segments (emph{blocks}) permuted by $pi$; call $k$ the emph{period} of this block structure. Let $p_1<dots
It is shown that the real class field towers are always finite. The proof is based on Castelnuovos theory of the algebraic surfaces and a functor from such surfaces to the Etesi C*-algebras.
This paper concerns towers of curves over a finite field with many rational points, following Garcia--Stichtenoth and Elkies. We present a new method to produce such towers. A key ingredient is the study of algebraic solutions to Fuchsian differentia
A simulation approach to the stochastic growth of bacterial towers is presented, in which a non-uniform and finite nutrient supply essentially determines the emerging structure through elementary chemotaxis. The method is based on cellular automata a