FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2625903537> ?p ?o ?g. }

• W2625903537 abstract "We introduce a family of mathematical objects called P-schemes, where P is a poset of subgroups of a finite group G. A P-scheme is a collection of partitions of the right coset spaces HG, indexed by H∈P, that satisfies a list of axioms. These objects generalize the classical notion of association schemes [BI84] as well as the notion of m-schemes [IKS09]. Based on P-schemes, we develop a unifying framework for the problem of deterministic factoring of univariate polynomials over finite field under the generalized Riemann hypothesis (GRH). More specifically, our results include the following: We show an equivalence between m-scheme as introduced in [IKS09] and P-schemes in the special setting that G is an multiply transitive permutation group and P is a poset of pointwise stabilizers, and therefore realize the theory of m-schemes as part of the richer theory of P-schemes. We give a generic deterministic algorithm that computes the factorization of the input ƒ(X) ∈ Fq[X] given a lifted polynomial ƒ~(X) of ƒ(X) and a collection F of effectively constructible subfields of the splitting field of ƒ~(X) over a certain base field. It is routine to compute ƒ~(X) from ƒ(X) by lifting the coefficients of ƒ(X) to a number ring. The algorithm then successfully factorizes ƒ(X) under GRH in time in the size of ƒ~(X) and F, provided that a certain condition concerning P-schemes is satisfied, for P being the poset of subgroups of the Galois group G of ƒ~(X) defined by F via the Galois correspondence. By considering various choices of G, P and verifying the condition, we are able to derive the main results of known (GRH-based) deterministic factoring algorithms [Hua91a; Hua91b; Ron88; Ron92; Evd92; Evd94; IKS09] from our generic algorithm in a uniform way. We investigate the schemes conjecture in [IKS09] and formulate analogous conjectures associated with various families of permutation groups, each of which has applications on deterministic factoring. Using a technique called induction of P-schemes, we establish reductions among these conjectures and show that they form a hierarchy of relaxations of the original schemes conjecture. We connect the complexity of deterministic factoring with the complexity of the Galois group G of ƒ~(X). Specifically, using techniques from permutation group theory, we obtain a (GRH-based) deterministic factoring algorithm whose running time is bounded in terms of the noncyclic composition factors of G. In particular, this algorithm runs in time if G is in Γk for some k=2O(√(log n), where Γk denotes the family of finite groups whose noncyclic composition factors are all isomorphic of subgroups of the symmetric group of degree k. Previously, polynomial-time algorithms for Γk were known only for bounded k. We discuss various aspects of the theory of P-schemes, including techniques of constructing new P-schemes from old ones, P-schemes for symmetric groups and linear groups, orbit P-schemes, etc. For the closely related theory of m-schemes, we provide explicit constructions of strongly antisymmetric homogeneous m-schemes for m≤3. We also show that all antisymmetric homogeneous orbit 3-schemes have a matching for m≥3, improving a result in [IKS09] that confirms the same statement for m≥4. In summary, our framework reduces the algorithmic problem of deterministic factoring over finite fields to a combinatorial problem concerning P-schemes, allowing us to not only recover most of the known results but also discover new ones. We believe progress in understanding P-schemes associated with various families of permutation groups will shed some light on the ultimate goal of solving deterministic factoring over finite fields in time." @default.
• W2625903537 created "2017-06-23" @default.
• W2625903537 creator A5004777401 @default.
• W2625903537 date "2017-01-01" @default.
• W2625903537 modified "2023-09-26" @default.
• W2625903537 title "P-schemes and Deterministic Polynomial Factoring Over Finite Fields" @default.
• W2625903537 doi "https://doi.org/10.7907/z94f1nsg." @default.
• W2625903537 hasPublicationYear "2017" @default.
• W2625903537 type Work @default.
• W2625903537 sameAs 2625903537 @default.
• W2625903537 citedByCount "1" @default.
• W2625903537 countsByYear W26259035372020 @default.
• W2625903537 crossrefType "dissertation" @default.
• W2625903537 hasAuthorship W2625903537A5004777401 @default.
• W2625903537 hasConcept C11413529 @default.
• W2625903537 hasConcept C114614502 @default.
• W2625903537 hasConcept C118615104 @default.
• W2625903537 hasConcept C121332964 @default.
• W2625903537 hasConcept C134306372 @default.
• W2625903537 hasConcept C178790620 @default.
• W2625903537 hasConcept C180645754 @default.
• W2625903537 hasConcept C185592680 @default.
• W2625903537 hasConcept C187834632 @default.
• W2625903537 hasConcept C21308566 @default.
• W2625903537 hasConcept C24890656 @default.
• W2625903537 hasConcept C2781311116 @default.
• W2625903537 hasConcept C33923547 @default.
• W2625903537 hasConcept C73361133 @default.
• W2625903537 hasConcept C77926391 @default.
• W2625903537 hasConcept C90119067 @default.
• W2625903537 hasConceptScore W2625903537C11413529 @default.
• W2625903537 hasConceptScore W2625903537C114614502 @default.
• W2625903537 hasConceptScore W2625903537C118615104 @default.
• W2625903537 hasConceptScore W2625903537C121332964 @default.
• W2625903537 hasConceptScore W2625903537C134306372 @default.
• W2625903537 hasConceptScore W2625903537C178790620 @default.
• W2625903537 hasConceptScore W2625903537C180645754 @default.
• W2625903537 hasConceptScore W2625903537C185592680 @default.
• W2625903537 hasConceptScore W2625903537C187834632 @default.
• W2625903537 hasConceptScore W2625903537C21308566 @default.
• W2625903537 hasConceptScore W2625903537C24890656 @default.
• W2625903537 hasConceptScore W2625903537C2781311116 @default.
• W2625903537 hasConceptScore W2625903537C33923547 @default.
• W2625903537 hasConceptScore W2625903537C73361133 @default.
• W2625903537 hasConceptScore W2625903537C77926391 @default.
• W2625903537 hasConceptScore W2625903537C90119067 @default.
• W2625903537 hasLocation W26259035371 @default.
• W2625903537 hasOpenAccess W2625903537 @default.
• W2625903537 hasPrimaryLocation W26259035371 @default.
• W2625903537 hasRelatedWork W1519955344 @default.
• W2625903537 hasRelatedWork W157332331 @default.
• W2625903537 hasRelatedWork W1808240002 @default.
• W2625903537 hasRelatedWork W2001411368 @default.
• W2625903537 hasRelatedWork W2042778336 @default.
• W2625903537 hasRelatedWork W2056341328 @default.
• W2625903537 hasRelatedWork W2170883457 @default.
• W2625903537 hasRelatedWork W2230948408 @default.
• W2625903537 hasRelatedWork W2379495559 @default.
• W2625903537 hasRelatedWork W2474151873 @default.
• W2625903537 hasRelatedWork W2595297869 @default.
• W2625903537 hasRelatedWork W2902302528 @default.
• W2625903537 hasRelatedWork W2950187223 @default.
• W2625903537 hasRelatedWork W2963334575 @default.
• W2625903537 hasRelatedWork W3023736450 @default.
• W2625903537 hasRelatedWork W3046791296 @default.
• W2625903537 hasRelatedWork W30891379 @default.
• W2625903537 hasRelatedWork W3096344391 @default.
• W2625903537 hasRelatedWork W3100477413 @default.
• W2625903537 hasRelatedWork W2245795263 @default.
• W2625903537 isParatext "false" @default.
• W2625903537 isRetracted "false" @default.
• W2625903537 magId "2625903537" @default.
• W2625903537 workType "dissertation" @default.