scholarly journals Grossberg–Karshon Twisted Cubes and Hesitant Jumping Walk Avoidance

10.37236/9278 ◽  
2020 ◽  
Vol 27 (3) ◽  
Author(s):  
Eunjeong Lee

Let $G$ be a complex simply-laced semisimple algebraic group of rank $r$ and $B$ a Borel subgroup. Let $\mathbf i \in [r]^n$ be a word and let $\boldsymbol{\ell} = (\ell_1,\dots,\ell_n)$ be a sequence of non-negative integers. Grossberg and Karshon introduced a virtual lattice polytope associated to $\mathbf i$ and $\boldsymbol{\ell}$ called a twisted cube, whose lattice points encode the character of a $B$-representation. More precisely, lattice points in the twisted cube, counted with sign according to a certain density function, yields the character of the generalized Demazure module determined by $\mathbf i$ and $\boldsymbol{\ell}$. In recent work, the author and Harada described precisely when the Grossberg–Karshon twisted cube is untwisted, i.e., the twisted cube is a closed convex polytope, in the situation when the integer sequence $\boldsymbol{\ell}$ comes from a weight $\lambda$ of $G$. However, not every integer sequence $\boldsymbol{\ell}$ comes from a weight of $G$. In the present paper, we interpret the untwistedness of Grossberg–Karshon twisted cubes associated with any word $\mathbf i$ and any integer sequence $\boldsymbol{\ell}$ using the combinatorics of $\mathbf i$ and $\boldsymbol{\ell}$. Indeed, we prove that the Grossberg–Karshon twisted cube is untwisted precisely when $\mathbf i$ is hesitant-jumping-$\boldsymbol{\ell}$-walk-avoiding.

2018 ◽  
Vol 29 (3) ◽  
pp. 326-327
Author(s):  
Simon M. Goodwin ◽  
Peter Mosch ◽  
Gerhard Röhrle

2000 ◽  
Vol 01 (02) ◽  
pp. 115-134 ◽  
Author(s):  
TSENG-KUEI LI ◽  
JIMMY J. M. TAN ◽  
LIH-HSING HSU ◽  
TING-YI SUNG

Given a shortest path routing algorithm of an interconnection network, the edge congestion is one of the important factors to evaluate the performance of this algorithm. In this paper, we consider the twisted cube, a variation of the hypercube with some better properties, and review the existing shortest path routing algorithm8. We find that its edge congestion under the routing algorithm is high. Then, we propose a new shortest path routing algorithm and show that our algorithm has optimum time complexity O(n) and optimum edge congestion 2n. Moreover, we calculate the bisection width of the twisted cube of dimension n.


2018 ◽  
Vol 10 (02) ◽  
pp. 1850023
Author(s):  
Xiaofang Jiang ◽  
Qinghui Liu ◽  
N. Parthiban ◽  
R. Sundara Rajan

A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper, we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, [Formula: see text]-cubes, etc., as the subfamilies.


Biometrika ◽  
2020 ◽  
Author(s):  
M L Hazelton ◽  
M R Mcveagh ◽  
B Van Brunt

Abstract For statistical linear inverse problems involving count data, inference typically requires sampling a latent variable with conditional support comprising the lattice points in a convex polytope. Irreducibility of random walk samplers is guaranteed only if a sufficiently rich array of sampling directions is available. In principle this can be achieved by finding a Markov basis of moves ab initio, but in practice doing so may be computationally infeasible. What is more, the use of a full Markov basis can lead to very poor mixing. It is far simpler to find a lattice basis of moves, which can be tailored to the overall geometry of the polytope. However, a single lattice basis generally does not connect all points in the polytope. In response, we propose a dynamic lattice basis sampler. This sampler can access a sufficient variety of sampling directions to guarantee irreducibility, but also privileges moves that are well aligned to the polytope geometry, hence promoting good mixing. The probability with which the sampler selects different bases can be tuned. We present an efficient algorithm for updating the lattice basis, obviating the need for repeated matrix inversion.


2018 ◽  
Vol 19 (2) ◽  
pp. 451-485 ◽  
Author(s):  
Stefan Papadima ◽  
Alexander I. Suciu

We study the germs at the origin of $G$-representation varieties and the degree 1 cohomology jump loci of fundamental groups of quasi-projective manifolds. Using the Morgan–Dupont model associated to a convenient compactification of such a manifold, we relate these germs to those of their infinitesimal counterparts, defined in terms of flat connections on those models. When the linear algebraic group $G$ is either $\text{SL}_{2}(\mathbb{C})$ or its standard Borel subgroup and the depth of the jump locus is 1, this dictionary works perfectly, allowing us to describe in this way explicit irreducible decompositions for the germs of these embedded jump loci. On the other hand, if either $G=\text{SL}_{n}(\mathbb{C})$ for some $n\geqslant 3$, or the depth is greater than 1, then certain natural inclusions of germs are strict.


1998 ◽  
Vol 21 (4) ◽  
pp. 741-748
Author(s):  
Geoffrey B. Campbell

New identities are given, based on ideas related to visible (from the origin) point vectors. Each result was found from summing on vpv lattices dividing space into radial regions from the origin. This is related to recent work by the author in which new partition type infinite products were derived. Also recently, Baake et al [3] and Mosseri [14] considered the 2-Dvisible lattice points as part of an optical experiment in which the so-called Optical Fourier Transform was applied. Many of the techniques espoused in Glasser and Zucker [11], and in Ninham et al [15] involving Mellin and Möbius inversions are applicable also to the current paper.


2018 ◽  
Vol 62 (2) ◽  
pp. 559-594
Author(s):  
Rolf Farnsteiner

AbstractLetUbe the unipotent radical of a Borel subgroup of a connected reductive algebraic groupG, which is defined over an algebraically closed fieldk. In this paper, we extend work by Goodwin and Röhrle concerning the commuting variety of Lie(U) for Char(k) = 0 to fields whose characteristic is good forG.


2018 ◽  
Vol 2019 (18) ◽  
pp. 5811-5853 ◽  
Author(s):  
Simon M Goodwin ◽  
Lewis W Topley

Abstract Let ${\mathbb{k}}$ be an algebraically closed field of characteristic p > 0 and let G be a connected reductive algebraic group over ${\mathbb{k}}$. Under some standard hypothesis on G, we give a direct approach to the finite W-algebra $U(\mathfrak{g},e)$ associated to a nilpotent element $e \in \mathfrak{g} = \textrm{Lie}\ G$. We prove a PBW theorem and deduce a number of consequences, then move on to define and study the p-centre of $U(\mathfrak{g},e)$, which allows us to define reduced finite W-algebras $U_{\eta}(\mathfrak{g},e)$ and we verify that they coincide with those previously appearing in the work of Premet. Finally, we prove a modular version of Skryabin’s equivalence of categories, generalizing recent work of the second author.


2020 ◽  
Vol 28 (2) ◽  
pp. 179-197
Author(s):  
Mikhail V. Ignatyev ◽  
Aleksandr A. Shevchenko

AbstractWe consider tangent cones to Schubert subvarieties of the flag variety G/B, where B is a Borel subgroup of a reductive complex algebraic group G of type E6, E7 or E8. We prove that if w1 and w2 form a good pair of involutions in the Weyl group W of G then the tangent cones Cw1 and Cw2 to the corresponding Schubert subvarieties of G/B do not coincide as subschemes of the tangent space to G/B at the neutral point.


2021 ◽  
Vol 29 (2) ◽  
pp. 171-182
Author(s):  
Mikhail V. Ignatev

Abstract A rook placement is a subset of a root system consisting of positive roots with pairwise non-positive inner products. To each rook placement in a root system one can assign the coadjoint orbit of the Borel subgroup of a reductive algebraic group with this root system. Degenerations of such orbits induce a natural partial order on the set of rook placements. We study combinatorial structure of the set of rook placements in An− 1 with respect to a slightly different order and prove that this poset is graded.


Sign in / Sign up

Export Citation Format

Share Document