Related papers: Delta sets for numerical semigroups with embedding…
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…
The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…
We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…
This article introduces patterns of ideals of numerical semigroups, thereby unifying previous definitions of patterns of numerical semigroups. Several results of general interest are proved. More precisely, this article presents results on…
In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…
We develop an algorithm that computes strongly continuous semigroups on infinite-dimensional Hilbert spaces with explicit error control. Given a generator $A$, a time $t>0$, an arbitrary initial vector $u_0$ and an error tolerance…
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.
Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semi-algebraic sets use symbolic quantifier elimination tools.…
This paper provides details of the massless three-loop three-point integrals calculation at the symmetric point. Our work aimed to extend known two-loop results for such integrals to the three-loop level. Obtained results can find their…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
In this paper we compute the Frobenius number of certain {\em Fibonacci numerical semigroups}, that is, numerical semigroups generated by a set of Fibonacci numbers, in terms of Fibonacci numbers.
We describe an elementary algorithm to build convex inner approximations of nonconvex sets. Both input and output sets are basic semialgebraic sets given as lists of defining multivariate polynomials. Even though no optimality guarantees…
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
In this paper, we present the point symmetry group of three-dimensional homogeneous Helmholtz equation, when we consider the cylindrical coordinate system. In continuation, we present a complete set of functionally independent invariants of…
Moment-sum-of-squares hierarchies of semidefinite programs can be used to approximate the volume of a given compact basic semialgebraic set K. The idea consists of approximating from above the indicator function of K with a sequence of…
We present constructions of symmetric complete sum-free sets in general finite cyclic groups. It is shown that the relative sizes of the sets are dense in $[0,\frac{1}{3}]$, answering a question of Cameron, and that the number of those…