Related papers: The $h$-vector of a relatively compressed level al…
For every vector $\overline \alpha\in \RR^n$ and for every rational approximation $(\overline p,q)\in \RR^n\times\RR$ we can associate the displacement vector $q\alpha-\overline p$. We focus on algebraic vectors, namely $\overline…
Given labeled points in a high-dimensional vector space, we seek a low-dimensional subspace such that projecting onto this subspace maintains some prescribed distance between points of differing labels. Intended applications include…
Metric algebras are metric variants of $\Sigma$-algebras. They are first introduced in the field of universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. Recently a similar notion of…
We introduce a notion of relative commutator -- an important special case being commutators twisted by an action -- as a straightforward modification of the definition of the Higgins commutator, establish its relation with a new notion of…
This is an introduction to geometric algebra, an alternative to traditional vector algebra that expands on it in two ways: 1. In addition to scalars and vectors, it defines new objects representing subspaces of any dimension. 2. It defines…
We give a combinatorial formula for the Ehrhart $h^*$-vector of the hypersimplex. In particular, we show that $h^{*}_{d}(\Delta_{k,n})$ is the number of hypersimplicial decorated ordered set partitions of type $(k,n)$ with winding number…
An algebra $\mathcal{A}$ of $n\times n$ complex matrices is said to be \textit{idempotent compressible} if $E\mathcal{A}E$ is an algebra for all idempotents $E\in\mathbb{M}_n(\mathbb{C})$. Analogously, $\mathcal{A}$ is said to be…
In this work, we refine recent results on the explicit construction of polynomial algebras associated with commutants of subalgebras in enveloping algebras of Lie algebras by considering an additional grading with respect to the subalgebra.…
This paper studies direct limits of full upper triangular matrix algebras with embeddings which are not *-extendible. A representation of the limit algebra is found so that the generated C*-algebra is the C*-envelope. Some examples are…
The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…
We give a presentation of localized affine and degenerate affine Hecke algebras of arbitrary type in terms of weights of the polynomial subalgebra and varied Demazure-BGG type operators. We offer a definition of a graded algebra…
The recent proof of the sharp weighted bound for Calder\'on-Zygmund operators has led to much investigation in sharp mixed bounds for operators and commutators, that is, a sharp weighted bound that is a product of at least two different…
In this paper we generalize the well known relation between Heyting algebras and Nelson algebras in the framework of subresiduated lattices. In order to make it possible, we introduce the variety of subresiduated Nelson algebras. The main…
We study $g$-vector cones in a cluster algebra defined from a weighted orbifold of rank $n$ introduced by Felikson, Shapiro and Tumarkin. We determine the closure of the union of the $g$-vector cones. It is equal to $\mathbb{R}^n$ except…
We begin a study of torsion theories for representations of an important class of associative algebras over a field which includes all finite W-algebras of type A, in particular the universal enveloping algebra of gl(n) (or sl(n)) for all…
The data-compatibility approach to constrained optimization, proposed here, strives to a point that is "close enough" to the solution set and whose target function value is "close enough" to the constrained minimum value. These notions can…
The decomposition problem of the enveloping algebra of a simple Lie algebra is reconsidered combining both the analytical and the algebraic approach, showing its relation with the internal labelling problem with respect to a nilpotent…
A new computationally simple method of imposing hard convex constraints on the neural network output values is proposed. The key idea behind the method is to map a vector of hidden parameters of the network to a point that is guaranteed to…
Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the…
We give a criterion for H-convergence of conductivity matrices in terms of ordinary weak convergence of the factors in certain quotient representations of the matrices.