On algorithms to find p-ordering

11/22/2020
by   Aditya Gulati, et al.
0

The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of polynomials modulo prime powers, and has been used to prove properties of roots sets modulo prime powers. We focus on the complexity of finding a p-ordering given a prime p, an exponent k and a subset of integers modulo p^k. Our first algorithm gives a p-ordering for set of size n in time O(nklogp), where set is considered modulo p^k. The subsets modulo p^k can be represented succinctly using the notion of representative roots (Panayi, PhD Thesis, 1995; Dwivedi et.al, ISSAC, 2019); a natural question would be, can we find a p-ordering more efficiently given this succinct representation. Our second algorithm achieves precisely that, we give a p-ordering in time O(d^2klogp + nk logp + nd), where d is the size of the succinct representation and n is the required length of the p-ordering. Another contribution that we make is to compute the structure of roots sets for prime powers p^k, when k is small. The number of root sets have been given in the previous work (Dearden and Metzger, Eur. J. Comb., 1997; Maulick, J. Comb. Theory, Ser. A, 2001), we explicitly describe all the root sets for p^2, p^3 and p^4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2020

A Note on the Cross-Correlation of Costas Permutations

We build on the work of Drakakis et al. (2011) on the maximal cross-corr...
research
07/11/2019

Stick Graphs with Length Constraints

Stick graphs are intersection graphs of horizontal and vertical line seg...
research
01/30/2023

On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits

We consider the problem EnumIP of enumerating prime implicants of Boolea...
research
11/15/2017

Set complexity of construction of a regular polygon

Given a subset of C containing x,y, one can add x + y or x - y or xy or...
research
04/26/2022

Formalizing a Diophantine Representation of the Set of Prime Numbers

The DPRM (Davis-Putnam-Robinson-Matiyasevich) theorem is the main step i...
research
11/15/2017

PQSER: A Matlab package for spectral seriation

The seriation problem is an important ordering issue which consists of f...
research
12/18/2019

The Maximin Share Dominance Relation

Given a finite set X and an ordering ≽ over its subsets, the l-out-of-d ...

Please sign up or login with your details

Forgot password? Click here to reset