نتایج جستجو برای: higman sims graph
تعداد نتایج: 201649 فیلتر نتایج به سال:
We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. In doing so, we make fundamental connections with both discrete geometry and algebraic combinatorics. particular, show are necessarily optimal packings in projective space, introduce fruitful generalization regular abelian distance-regular antipodal covers complete gr...
ToF-SIMS has been used in the analysis of latent fingerprints (dactyloscopy) with a view to use in forensic and biomedical applications. Szynkowska et al have demonstrated that SIMS can be employed to produce images of whole fingerprints on inorganic surfaces such as steel, brass and glass (1). We demonstrate the detection of a range of exogenous materials in fingerprints including industrial l...
Chemical imaging of single cells at the molecular level is important in capturing biological dynamics. Single cell correlative imaging is realized between super-resolution microscopy, namely, structured illumination microscopy (SIM), and time-of-flight secondary ion mass spectrometry (ToF-SIMS) using a multimodal microreactor (i.e., System for Analysis at the Liquid Vacuum Interface, SALVI). SI...
We show, by introducing an appropriate basis, that a one-parameter family of Hopf algebras introduced by Foissy [Adv. Math. 218 (2008) 136-162] interpolates beetween the Faà di Bruno algebra and the Farahat-Higman algebra. Its structure constants in this basis are deformation of the top connection coefficients, for which we obtain analogues of Macdonald’s formulas.
We prove that the only finite factor-representations of the HigmanThompson groups {Fn,r}, {Gn,r} are the regular representations and scalar representations arising from group abelianizations. As a corollary, we obtain that any measure-preserving ergodic action of a simple Higman-Thompson group must be essentially free. Finite factor representations of other classes of groups are also discussed.
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
We consider certain decision problems for the free model of theory Cartesian monoids. introduce a computation based on notion single stack one-way PDA due to Ginsburg, Greibach and Harrison. This allows us solve such as (1) Given finite set B elements an element F, is F product members B? (2) Is submonoid generated by infinite? fragments monoid. These include right invertible so our results app...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید