Related papers: Nonhomogeneous patterns on numerical semigroups
Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
We define a reflective numerical semigroup of genus $g$ as a numerical semigroup that has a certain reflective symmetry when viewed within $\mathbb{Z}$ as an array with $g$ columns. Equivalently, a reflective numerical semigroup has one gap…
This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…
We say that a semigroup of matrices has a submultiplicative spectrum if the spectrum of the product of any two elements of the semigroup is contained in the product of the two spectra in question (as sets). In this note we explore an…
This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…
We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…
It was claimed in [4] that for any integer $n\geqslant 2$, a neutral element can be adjoined to an $n$-ary semigroup if and only if the $n$-ary semigroup is reducible to a binary semigroup. We show that the `only if' direction of this…
A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
We give a criterion for the existence of a non-degenerate quasihomogeneous polynomial in a configuration, i.e. in the space of polynomials with a fixed set of weights, and clarify the relation of this criterion to the necessary condition…
Many data sets contain an inherent multilevel structure, for example, because of repeated measurements of the same observational units. Taking this structure into account is critical for the accuracy and calibration of any statistical…
The category of admissible (in the appropriately modified sense of representation theory of totally disconnected groups) semi-linear representations of the automorphism group of an algebraically closed extension of infinite transcendence…
A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate…
We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers.…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…
Positive $C_0$-semigroups that occur in concrete applications are, more often than not, irreducible. Therefore a deep and extensive theory of irreducibility has been developed that includes characterizations, perturbation analysis, and…
For finite-dimensional linear semigroups which leave a proper cone invariant it is shown that irreducibility with respect to the cone implies the existence of an extremal norm. In case the cone is simplicial a similar statement applies to…