相关论文: A realization theorem for sets of lengths in numer…
We prove that an abstract (possibly infinite dimensional) complex irreducible representation of a discrete supersolvable group is monomial if and only if it has finite weight. We also prove a general result that implies converse of Schur's…
We prove that if $M$ is a monoid and $A$ a finite set with more than one element, then the residual finiteness of $M$ is equivalent to that of the monoid consisting of all cellular automata over $M$ with alphabet $A$.
It is well-known that small categories have equivalent descriptions as partial monoids. We provide a formulation of partial monoid and partial monoid homomorphism involving $s$ and $t$ instead of identities and then following a recent…
We give a new proof of Hilbert's Syzygy Theorem for monomial ideals. In addition, we prove the following. If S=k[x_1,...,x_n] is a polynomial ring over a field, M is a squarefree monomial ideal in S, and each minimal generator of M has…
The (co)homological dimension of homomorphism $\phi:G\to H$ is the maximal number $k$ such that the induced homomorphism is nonzero for some $H$-module. The following theorems are proven: THEOREM 1. For every homomorphism $\phi:G\to H$ of a…
This paper is a study of the set of rational numbers of the form 1 < a^q /b^p < a with a and b co-prime integers. The set F (a,b) of these numbers, with an appropriate binary law, is a monoid isomorphic to (N, +, 0). We identify the…
A set $B$ is said to be \emph{sum-free} if there are no $x,y,z\in B$ with $x+y=z$. We show that there exists a constant $c>0$ such that any set $A$ of $n$ integers contains a sum-free subset $A'$ of size $|A'|\geqslant n/3+c\log \log n$.…
It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.
Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…
The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…
Let $S \subset \mathbb{N}_0$ be a numerical monoid and let $\mathcal P_{\mathrm{fin}} (S)$, resp $\mathcal P_{\mathrm{fin},0}(S)$, denote the power monoid, resp. the restricted power monoid, of $S$, that is the set of all finite nonempty…
For a positive integer $d$, a non-negative integer $n$ and a non-negative integer $h\leq n$, we study the number $C_{n}^{(d)}$ of principal ideals; and the number $C_{n,h}^{(d)}$ of principal ideals generated by an element of rank $h$, in…
A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…
Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . Suppose that $I$ is either generated by three monomials of degrees $d$ and a set of monomials of…
Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…
We prove that any finite set of real numbers can be split into two parts, one part being highly non-additive and the other highly non-multiplicative.
The left and right diameters of a monoid are topological invariants defined in terms of suprema of lengths of derivation sequences with respect to finite generating sets for the universal left or right congruences. We compute these…
Let R=S/I be a monomial ring whose minimal free resolution F is rooted. We describe an A-infinity algebra structure on F. Using this structure, we show that R is Golod if and only if the product on Tor^S(R,k) vanishes. Furthermore, we give…
From any poset isomorphic to the poset of gaps of a numerical semigroup $S$ with the order induced by $S$, one can recover $S$. As an application, we prove that two different numerical semigroups cannot have isomorphic posets (with respect…
A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…