Related papers: A new Boolean matrix representation for Catalan se…
In this paper, we prove that the matrix between a special PBW basis and the semicanonical basis of $U^+(sl_n(\mathbb{C}))$ is upper triangular unipotent under any order which is compatible with the partial order $\leq_{deg}$.
We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…
A new class of alternating convolutions concerning binomial coefficients and Catalan numbers are evaluated in closed forms.
We derive new matrix representation for higher-order changhee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on higher-order changhee numbers and polynomials. Moreover, we obtain recurrence…
The Hodge algebra structures on the homogeneous coordinate rings of Grassmann varieties provide semi-toric degenerations of these varieties. In this paper we construct these semi-toric degenerations using quasi-valuations and triangulations…
Boolean matrix factorization and Boolean matrix completion from noisy observations are desirable unsupervised data-analysis methods due to their interpretability, but hard to perform due to their NP-hardness. We treat these problems as…
We present a unified framework for representing commutative rings through affine algebraic theories and Boolean rings through hyperaffine algebraic theories. This yields categorical equivalences between these theories and, respectively,…
We propose a new class of mathematical structures called (m,n)-semirings} (which generalize the usual semirings), and describe their basic properties. We also define partial ordering, and generalize the concepts of congruence, homomorphism,…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
We provide a logical characterization of non-deterministic polynomial time defined by BSS machines over semirings via existential second-order logic interpreted in the semiring semantics developed by Gr\"adel and Tannen. Furthermore, we…
We examine a semigroup analogue of the Kumjian-Renault representation of C*-algebras with Cartan subalgebras on twisted groupoids. Specifically, we show how to represent semigroups with distinguished normal subsemigroups as `slice-sections'…
The present work looks at semiautomatic rings with automatic addition and comparisons which are dense subrings of the real numbers and asks how these can be used to represent geometric objects such that certain operations and…
We study the first-order axiomatisability of finite semiring interpretations or, equivalently, the question whether elementary equivalence and isomorphism coincide for valuations of atomic facts over a finite universe into a commutative…
Theoretical predictions for inclusive semileptonic B decay rates are rewritten in terms of the Upsilon(1S) meson mass instead of the b quark mass, using a modified perturbation expansion. This method gives theoretically consistent and…
We give three algorithms to construct a semistandard tableau of given shape and weight, where the weight is a composition which is not necessarily a partition. With respect to a natural partial order on the set of semistandard tableaux, we…
Subgroups of the symmetric group $S_n$ act on powers of chains $C^n$ by permuting coordinates, and induce automorphisms of the ordered sets $C^n$. The quotients defined are candidates for symmetric chain decompositions. We establish this…
We characterise the respective semigroups of mappings that preserve, or that preserve or reverse orientation of a finite cycle, in terms of their actions on oriented triples and oriented quadruples. This leads to a proof that the latter…
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
A Latin square of order $n$ is an $n\times n$ matrix in which each row and column contains each of $n$ symbols exactly once. For $\epsilon>0$, we show that with high probability a uniformly random Latin square of order $n$ has no proper…
We present an alternative to the conventional matrix product state representation, which allows us to avoid the explicit local Hilbert space truncation many numerical methods employ. Utilising chain mappings corresponding to linear and…