Related papers: Delta sets for numerical semigroups with embedding…
We give closed product formulas for the irreducible characters of the symmetric groups related to rectangular `almost square' Young diagrams $p \times(p+\delta)$ for a fixed value of an integer $\delta$ and an arbitrary integer $p$.
The aim of the present paper is to obtain a classification of all the irreducible modular representations of the symmetric group on $n$ letters of dimension at most $n^3$, including dimension formulae. This is achieved by improving an idea,…
We introduce square diagrams that represent numerical semigroups and we obtain an injection from the set of numerical semigroups into the set of Dyck paths.
We initiate the rigorous study of classification in semimetric spaces, which are point sets with a distance function that is non-negative and symmetric, but need not satisfy the triangle inequality. For metric spaces, the doubling dimension…
The three domatic number problem asks whether a given undirected graph can be partitioned into at least three dominating sets, i.e., sets whose closed neighborhood equals the vertex set of the graph. Since this problem is NP-complete, no…
In this paper we construct exponentionally many non-isomorphic skew Hadamard difference sets over an elementary abelian group of order $q^3$.
Two quantum algorithms are presented, which tackle well--known problems in the context of numerical semigroups: the numerical semigroup membership problem (NSMP) and the Sylvester denumerant problem (SDP).
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…
Let $\Delta$ be a numerical semigroup and let $d\ge 2$ be an integer. We study the fiber of the quotient map \(S\mapsto S/d\) over $\Delta$. We describe its elements as semigroups of the form $\langle X\rangle+d\Delta$, for suitable finite…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering…
In this article, we investigate the image and preimage of the important combinatorial sets such as central sets, $C$-sets, and $J_\delta$-sets which play an important role in the study of combinatorics under certain partial semigroup…
We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…
We calculate the three loop gauge $\beta$-function for an abelian $N=1$ supersymmetric gauge theory, using DRED. We construct a coupling constant redefinition that relates the result to the corresponding term in the NSVZ $\beta$-function,…
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
The catenary degree is an invariant that measures the distance between factorizations of elements within a numerical semigroup. In general, all possible catenary degrees of the elements of the numerical semigroups occur as the catenary…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…