Related papers: Symmetric ladders and G-biliaison

A major open question in the theory of Gorenstein liaison is whether or not every arithmetically Cohen--Macaulay subscheme of $\mathbb{P}^n$ can be G-linked to a complete intersection. Migliore and Nagel showed that, if such a scheme is…

In this paper, we investigate the ideals of semidirect products of L-algebras and the structure of simple L-algebras. We provide a precise characterization of the ideals of semidirect products and describe the structure of their prime…

We study the convergence properties of the Gibbs Sampler in the context of posterior distributions arising from Bayesian analysis of conditionally Gaussian hierarchical models. We develop a multigrid approach to derive analytic expressions…

The vector space of m x n complex matrices (m >= n) admits a natural action of the group GL = GL_m x GL_n via row and column operations. For positive integers a,b, we consider the ideal I_{a x b} defined as the smallest GL-equivariant ideal…

This paper presents an algebraic construction of families of unitary matrices that achieve full diversity. They are obtained as subsets of cyclic division algebras.

We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…

In order to make graphical Gaussian models a viable modelling tool when the number of variables outgrows the number of observations, model classes which place equality restrictions on concentrations or partial correlations have previously…

Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…

In this article we construct a large family of $R$-matrices for various extensions of small quantum groups by grouplike elements. The extensions are in correspondence to lattices between root and weight lattice and admit $R$-matrices in…

A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…

Inspired by recent work in the theory of central projections onto hypersurfaces, we characterize self-linked perfect ideals of grade 2 as those with a Hilbert--Burch matrix that has a maximal symmetric subblock. We also prove that every…

In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G)[E(G) is called the mixed metric dimension of G. In this paper we first establish the exact value of the mixed metric dimension…

We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded…

Let K be a field of positive characteristic. When V is a linear variety in K^n and G is a finitely generated subgroup of K^*, we show how to compute the intersection of V and G^n effectively using heights. We calculate all the estimates…

In a previous work [Scientific Reports 4, 6193(2014)] we proved the existence of scale symmetry in square and triangular (thus honeycomb) lattices by investigating the functiony=\arcsin(\sin(2\pinx)), where the parameter is either the…

We consider the multiplier ideals of the ideal of a reduced union of lines through the origin in C^3. For general arrangements of lines, we calculate the multiplier ideals.

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…

This article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal $I_+(\mathcal C)$ to an arbitrary linear code. The binomials…