Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPeriodic staircase matrices and generalized cluster structures
476
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
As is well-known, cluster transformations in cluster structures of geometric type are often modeled on determinant identities, such as short Plucker relations, Desnanot--Jacobi identities and their generalizations. We present a construction that plays a similar role in a description of generalized cluster transformations and discuss its applications to generalized cluster structures in GL_n compatible with a certain subclass of Belavin--Drinfeld Poisson--Lie brackets, in the Drinfeld double of GL_n, and in spaces of periodic difference operators.
rate research
Read More
We relate the Weyr structure of a square matrix $B$ to that of the $t times t$ block upper triangular matrix $C$ that has $B$ down the main diagonal and first superdiagonal, and zeros elsewhere. Of special interest is the case $t = 2$ and where $C$ is the $n$th Sierpinski matrix $B_n$, which is defined inductively by $B_0 = 1$ and $B_n = left[begin{array}{cc} B_{n-1} & B_{n-1} 0 & B_{n-1} end{array} right]$. This yields an easy derivation of the Weyr structure of $B_n$ as the binomial coefficients arranged in decreasing order. Earlier proofs of the Jordan analogue of this had often relied on deep theorems from such areas as algebraic geometry. The result has interesting consequences for commutative, finite-dimension algebras.
The $F$-signature is a numerical invariant defined by the number of free direct summands in the Frobenius push-forward, and it measures singularities in positive characteristic. It can be generalized by focussing on the number of non-free direct summands. In this paper, we provide several methods to compute the (generalized) $F$-signature of a Hibi ring which is a special class of toric rings. In particular, we show that it can be computed by counting the elements in the symmetric group satisfying certain conditions. As an application, we also give the formula of the (generalized) $F$-signature for some Segre products of polynomial rings.
In this paper we study the equations of the elimination ideal associated with $n+1$ generic multihomogeneous polynomials defined over a product of projective spaces of dimension $n$. We first prove a duality property and then make this duality explicit by introducing multigraded Sylvester forms. These results provide a partial generalization of similar properties that are known in the setting of homogeneous polynomial systems defined over a single projective space. As an important consequence, we derive a new family of elimination matrices that can be used for solving zero-dimensional multiprojective polynomial systems by means of linear algebra methods.
Minimal Markov bases of configurations of integer vectors correspond to minimal binomial generating sets of the assocciated lattice ideal. We give necessary and sufficient conditions for the elements of a minimal Markov basis to be (a) inside the universal Gr{ o}bner basis and (b) inside the Graver basis. We study properties of Markov bases of generalized Lawrence liftings for arbitrary matrices $Ainmathcal{M}_{mtimes n}(Bbb{Z})$ and $Binmathcal{M}_{ptimes n}(Bbb{Z})$ and show that in cases of interest the {em complexity} of any two Markov bases is the same.
Principal matrices of a numerical semigroup of embedding dimension n are special types of $n times n$ matrices over integers of rank $leq n - 1$. We show that such matrices and even the pseudo principal matrices of size n must have rank $geq frac{n}{2}$ regardless of the embedding dimension. We give structure theorems for pseudo principal matrices for which at least one $n - 1 times n - 1$ principal minor vanish and thereby characterize the semigroups in embedding dimensions $4$ and $5$ in terms of their principal matrices. When the pseudo principal matrix is of rank $n - 1$, we give a sufficient condition for it to be principal.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
