Abstract
The current state of available software tools for near-rings over finitecyclic groups is such that the final steps of the research into new theorems that describegroups of these near-rings must be done manually. We propose an approach and havedeveloped an algorithm for automatically matching groups of near-rings over finitecyclic groups to already existing theorems. Additional parts of the developed softwaremodule filter out the already described near-rings and group the remaining ones intobatches of items with similar or same dependencies between the elements inside them.The final step is outputting these groups into a human-readable format, which aidsmathematicians’ investigation into new theorems and hypotheses.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International journal of differential equations and applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
