Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn numerical semigroups with at most 12 left elements
56
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
For a numerical semigroup S $subseteq$ N with embedding dimension e, conductor c and left part L = S $cap$ [0, c -- 1], set W (S) = e|L| -- c. In 1978 Wilf asked, in equivalent terms, whether W (S) $ge$ 0 always holds, a question known since as Wilfs conjecture. Using a closely related lower bound W 0 (S) $le$ W (S), we show that if |L| $le$ 12 then W 0 (S) $ge$ 0, thereby settling Wilfs conjecture in this case. This is best possible, since cases are known where |L| = 13 and W 0 (S) = --1. Wilfs conjecture remains open for |L| $ge$ 13.
rate research
Read More
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 this class yields a new family of Frobenius generalized numerical semigroups and extends the class of irreducible generalized numerical semigroups. This investigation allows us to provide a method of computing all almost symmetric generalized numerical semigroup having a fixed Frobenius element and organizing them in a rooted tree depending on a chosen monomial order.
Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is cyclically fully commutative (CFC) if every cyclic shift of any reduced expression for w is fully commutative (i.e., avoids long braid relations). These generalize Coxeter elements in that their reduced expressions can be described combinatorially by acyclic directed graphs, and cyclically shifting corresponds to source-to-sink
We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many nonisomorphic finitely generated models, that every finitely generated model has an ordinal rank. This rank is used to give a prop- erty of finitely generated models analogue to the Hopf property of groups and also to give a necessary and sufficient condition for a finitely generated model to be prime of its complete theory. We investigate some properties of limit groups of equationally noetherian groups, in respect to their ranks.
Pairwise non-isomorphic semigroups obtained from the finite inverse symmetric semigroup $mathcal{IS}_n ,$ finite symmetric semigroup $mathcal{T}_n$ and bicyclic semigroup by the deformed multiplication proposed by Ljapin are classified.
We present the first steps towards the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to 1 or -1. Here we deal with the disconnected, the bipartite and the complete signed graphs. In addition, we present many examples which cannot be obtained from an unsigned graph or its negative by switching.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
