相关论文: The great trinomial hunt
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
We consider a particular case of an analog for elliptic curves to the Mersenne problem : finding explicitely all prime power terms in an elliptic divisibility sequence when descent via isogeny is possible. We explain how this question can…
Multinets are certain configurations of lines and points with multiplicities in the complex projective plane $\mathbb{P}^2$. They appear in the study of resonance and characteristic varieties of complex hyperplane arrangement complements…
We invoke some ideas from finite geometry to map bijectively 135 heptads of mutually commuting three-qubit observables into 135 symmetric four-qubit ones. After labeling the elements of the former set in terms of a seven-dimensional…
This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…
In this paper we describe an algorithm visiting all numerical semigroups up to a given genus using a well suited representation. The interest of this algorithm is that it fits particularly well the architecture of modern computers allowing…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…
As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree $(q^n-1)/(q-1)$ of ${\rm L}_n(q)$ is prime. We present…
We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the 106 basic invariants.
We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
We introduce Selective Greedy Equivalence Search (SGES), a restricted version of Greedy Equivalence Search (GES). SGES retains the asymptotic correctness of GES but, unlike GES, has polynomial performance guarantees. In particular, we show…
We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…
Automatically constructing taxonomy finds many applications in e-commerce and web search. One critical challenge is as data and business scope grow in real applications, new concepts are emerging and needed to be added to the existing…
We show that there are algorithms to determine if a 3-manifold contains an essential lamination or a Reebless foliation.
By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…
We introduce a system of invariants of isotopy classes of Morse polynomials ${\mathbb R}^2 \to {\mathbb R}^1$, prove its completeness for polynomials of degrees $\leq 4$, calculate all 71 possible values of these invariants for the case of…