Log in

Relevant bibliographies by topics / Regular polynomial

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Regular polynomial'

Author: Grafiati

Published: 26 October 2022

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Regular polynomial.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Regular polynomial"

1

Rasool, Kavi B., Payman A. Rashed, and Ahmed M. Ali. "Relations Between Vertex–Edge Degree Based Topological Indices and Mve-Polynomial of r−Regular Simple Graph." European Journal of Pure and Applied Mathematics 16, no. 2 (2023): 773–83. http://dx.doi.org/10.29020/nybg.ejpam.v16i2.4698.

Full text

Abstract:

One of the more exciting polynomials among the newly presented graph algebraic polynomials is the M−Polynomial, which is a standard method for calculating degree−based topological indices. In this paper, we define the Mve−polynomials based on vertex edge degree and derive various vertex–edge degree based topological indices from them. Thus, for any graph, we provide some relationships between vertex–edge degree topological indices. Also, we discuss the general Mve−polynomial of r−regular simple graph. Finally, we computed the Mve−polynomial of the 2−ary tree graph.

APA, Harvard, Vancouver, ISO, and other styles

2

Merikoski, Jorma K. "Regular polygons, Morgan-Voyce polynomials, and Chebyshev polynomials." Notes on Number Theory and Discrete Mathematics 27, no. 2 (2021): 79–87. http://dx.doi.org/10.7546/nntdm.2021.27.2.79-87.

Full text

Abstract:

We say that a monic polynomial with integer coefficients is a polygomial if its each zero is obtained by squaring the edge or a diagonal of a regular n-gon with unit circumradius. We find connections of certain polygomials with Morgan-Voyce polynomials and further with Chebyshev polynomials of second kind.

APA, Harvard, Vancouver, ISO, and other styles

3

Lee, Jae-Ho. "Nonsymmetric Askey–Wilson polynomials and Q -polynomial distance-regular graphs." Journal of Combinatorial Theory, Series A 147 (April 2017): 75–118. http://dx.doi.org/10.1016/j.jcta.2016.11.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Meleshkin, A. V. "Regular semigroups of polynomial growth." Mathematical Notes of the Academy of Sciences of the USSR 47, no. 2 (1990): 152–58. http://dx.doi.org/10.1007/bf01156824.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Carballosa, Walter, José M. Rodríguez, José M. Sigarreta, and Yadira Torres-Nuñez. "Alliance polynomial of regular graphs." Discrete Applied Mathematics 225 (July 2017): 22–32. http://dx.doi.org/10.1016/j.dam.2017.03.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kamgarpour, Masoud, GyeongHyeon Nam, and Anna Puskás. "Arithmetic geometry of character varieties with regular monodromy." Representation Theory 29, no. 11 (2025): 347–78. https://doi.org/10.1090/ert/693.

Full text

Abstract:

We count points on a family of smooth character varieties with regular semisimple and regular unipotent monodromies. We show that these varieties are polynomial count and obtain an explicit expression for their E E -polynomials using complex representation theory of finite reductive groups. As an application, we give an example of a cohomologically rigid representation which is not physically rigid.

APA, Harvard, Vancouver, ISO, and other styles

7

Berthomieu, Jérémy, Jean-Charles Faugère, and Ludovic Perret. "Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case." Journal of Complexity 31, no. 4 (2015): 590–616. http://dx.doi.org/10.1016/j.jco.2015.04.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Galetto, Federico, Anthony Vito Geramita, and David Louis Wehlau. "Degrees of Regular Sequences With a Symmetric Group Action." Canadian Journal of Mathematics 71, no. 03 (2019): 557–78. http://dx.doi.org/10.4153/cjm-2017-035-3.

Full text

Abstract:

AbstractWe consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible isomorphism types for these ideals. Following up on that work, we now analyze the possible degrees of the elements in such regular sequences. For each case of our classification, we provide some criteria guaranteeing the existence of regular sequences in certain degrees.

APA, Harvard, Vancouver, ISO, and other styles

9

Birget, J. C. "Semigroups and one-way functions." International Journal of Algebra and Computation 25, no. 01n02 (2015): 3–36. http://dx.doi.org/10.1142/s0218196715400019.

Full text

Abstract:

We study the complexity classes 𝖯 and 𝖭𝖯 through a semigroup 𝖿𝖯 ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. The semigroup 𝖿𝖯 is non-regular if and only if 𝖯 ≠ 𝖭𝖯. The one-way functions considered here are based on worst-case complexity (they are not cryptographic); they are exactly the non-regular elements of 𝖿𝖯. We prove various properties of 𝖿𝖯, e.g. that it is finitely generated. We define reductions with respect to which certain universal one-way functions are 𝖿𝖯-complete.

APA, Harvard, Vancouver, ISO, and other styles

10

Han, Yo-Sub, Kai Salomaa, and Derick Wood. "Intercode Regular Languages." Fundamenta Informaticae 76, no. 1-2 (2007): 113–28. https://doi.org/10.3233/fun-2007-761-208.

Full text

Abstract:

Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for determining whether or not a given regular language L is an intercode. If the answer is yes, our algorithm yields also the smallest index k such that L is a k-intercode. Furthermore, we examine the prime intercode decomposition of intercode regular languages and design an algorithm for the intercode primality test of an intercode recognized by a finite-state automaton. We also propose an algorithm that computes the pri

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Regular polynomial"

1

Moreira, Joel Moreira. "Partition regular polynomial patterns in commutative semigroups." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1467131194.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Molina, Aristizabal Sergio D. "Semi-Regular Sequences over F2." University of Cincinnati / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1445342810.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Colleaux, Aimeric. "Regular black hole and cosmological spacetimes in Non-Polynomial Gravity theories." Doctoral thesis, Università degli studi di Trento, 2019. https://hdl.handle.net/11572/369192.

Full text

Abstract:

General Relativity is known to suffer from singularities at short distances, which indicates the breakdown of its predictability, for instance at the center of black holes, and in the very early universe. This is one of the main reason to look for a Quantum Theory of Gravity, that would describe spacetime geometry as a quantum field, and possibly cure these classical singularities. However, no consensus on the topic has yet been reached, as many different approaches have been proposed, but none has yet received an experimental confirmation. This is in part due to the extraordinary small scale

APA, Harvard, Vancouver, ISO, and other styles

4

Colleaux, Aimeric. "Regular black hole and cosmological spacetimes in Non-Polynomial Gravity theories." Doctoral thesis, University of Trento, 2019. http://eprints-phd.biblio.unitn.it/3752/1/ThesisFinalVersion.pdf.

Full text

Abstract:

General Relativity is known to suffer from singularities at short distances, which indicates the breakdown of its predictability, for instance at the center of black holes, and in the very early universe. This is one of the main reason to look for a Quantum Theory of Gravity, that would describe spacetime geometry as a quantum field, and possibly cure these classical singularities. However, no consensus on the topic has yet been reached, as many different approaches have been proposed, but none has yet received an experimental confirmation. This is in part due to the extraordinary small scale

APA, Harvard, Vancouver, ISO, and other styles

5

Mehrabdollahei, Mahya. "La mesure de Mahler d’une famille de polynômes exacts." Thesis, Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS170.pdf.

Full text

Abstract:

Dans cette thèse, nous étudions la suite de mesures de Mahler d’une famille de polynômes à deux variables exacts et réguliers, que nous notons Pd := P0≤i+j≤d xiyj . Elle n’est bornée ni en volume, ni en genre de la courbe algébrique sous-jacente. Nous obtenons une expression pour la mesure de Mahler de Pd comme somme finie de valeurs spéciales du dilogarithme de Bloch-Wigner. Nous utilisons SageMath pour approximer m(Pd) pour 1 ≤ d ≤ 1000. En recourant à trois méthodes différentes, nous prouvons que la limite de la suite de mesures de Mahler de cette famille converge vers 92π2 ζ(3). De plus, n

APA, Harvard, Vancouver, ISO, and other styles

6

Lopes, Aislan Sirino. "CritÃrio para a construtibilidade de polÃgonos regulares por rÃgua e compasso e nÃmeros construtÃveis." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12590.

Full text

Abstract:

CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior<br>Este trabalho aborda construÃÃes geomÃtricas elementares e de polÃgonos regulares realizadas com rÃgua nÃo graduada e compasso respeitando as regras ou operaÃÃes elementares usadas na Antiguidade pelos gregos. Tais construÃÃes serÃo inicialmente tratadas de uma forma puramente geomÃtrica e, a fim de encontrar um critÃrio que possa determinar a possibilidade de construÃÃo de polÃgonos regulares, passarÃo a ser discutidas por um viÃs algÃbrico. Este tratamento algÃbrico evidenciarÃ uma relaÃÃo entre a geometria e a Ãlgebra, em especi

APA, Harvard, Vancouver, ISO, and other styles

7

Cruz, Carla Maria. "Numerical and combinatorial applications of generalized Appell polynomials." Doctoral thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/13962.

Full text

Abstract:

Doutoramento em Matemática<br>This thesis studies properties and applications of different generalized Appell polynomials in the framework of Clifford analysis. As an example of 3D-quasi-conformal mappings realized by generalized Appell polynomials, an analogue of the complex Joukowski transformation of order two is introduced. The consideration of a Pascal n-simplex with hypercomplex entries allows stressing the combinatorial relevance of hypercomplex Appell polynomials. The concept of totally regular variables and its relation to generalized Appell polynomials leads to the constructi

APA, Harvard, Vancouver, ISO, and other styles

8

Szumowicz, Anna Maria. "Regular representations of GLn( O) and the inertial Langlands correspondence." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS360.

Full text

Abstract:

Cette thèse contient deux parties. La première porte sur la théorie des représentations des groupes p-adiques. Le but est de trouver de nouvelles informations et de nouveaux invariants des types cuspidaux de groupes linéaires généraux. Soit F un corps local non archimédien et soit OF son anneau des entiers. Nous décrivons les types cuspidaux sur GLp(OF ) (où p est un nombre premier) en termes d’orbites. Nous déterminons quels types cuspidaux sont réguliers et donnons un exemple qui montre que l’orbite de la représentation ne suffit pas à déterminer si la représentation est un type cuspidal ou

APA, Harvard, Vancouver, ISO, and other styles

9

Alici, Haydar. "A General Pseudospectral Formulation Of A Class Of Sturm-liouville Systems." Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612435/index.pdf.

Full text

Abstract:

In this thesis, a general pseudospectral formulation for a class of Sturm-Liouville eigenvalue problems is consructed. It is shown that almost all, regular or singular, Sturm-Liouville eigenvalue problems in the Schr&ouml<br>dinger form may be transformed into a more tractable form. This tractable form will be called here a weighted equation of hypergeometric type with a perturbation (WEHTP) since the non-weighted and unperturbed part of it is known as the equation of hypergeometric type (EHT). It is well known that the EHT has polynomial solutions which form a basis for the Hilbert space of s

APA, Harvard, Vancouver, ISO, and other styles

10

Lang, Stanislav. "Řešení spojitých systémů evolučními výpočetními technikami." Doctoral thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2018. http://www.nusl.cz/ntk/nusl-371772.

Full text

Abstract:

The thesis deals the issue of solution of continuous systems by evolutionary computational techniques. Evolutionary computing techniques fall into the field of softcomputing, an advanced metaheuristics optimization that is becoming more and more a method of solving complicated optimization problems with the gradual increase in computing performance of computers. The solution of continuous systems, or the synthesis of continuous control circuits, is one of the areas where these advanced algorithms find their application. When dealing with continuous systems we will focus on regulatory issues. E

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Regular polynomial"

1

Completeness of root functions of regular differential operators. Longman Scientific & Technical, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sheehan, Daniel Dean. Interpolating a regular grid of elevations from random points using three algorithms: Kriging, splines, and polynomial surfaces. 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Regular solids and isolated singularities. Vieweg, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Regular polynomial"

1

Brouwer, Andries E., Arjeh M. Cohen, and Arnold Neumaier. "Q-polynomial Distance-Regular Graphs." In Distance-Regular Graphs. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yakubov, Sasun. "Unbounded polynomial operator pencils." In Completeness of Root Functions of Regular Differential Operators. Routledge, 2021. https://doi.org/10.1201/9781315139838-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Szilard, Andrew, Sheng Yu, Kaizhong Zhang, and Jeffrey Shallit. "Characterizing regular languages with polynomial densities." In Mathematical Foundations of Computer Science 1992. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55808-x_48.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Piponi, Dan, and Brent A. Yorgey. "Polynomial Functors Constrained by Regular Expressions." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19797-5_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Klíma, Ondřej, and Libor Polák. "Polynomial Operators on Classes of Regular Languages." In Algebraic Informatics. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03564-7_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mortini, Raymond, and Rudolf Rupp. "Polynomial, Noetherian, and von Neumann regular rings." In Extension Problems and Stable Ranks. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-73872-3_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Salahi, Maziar, and Tamás Terlaky. "Self-Regular Interior-Point Methods for Semidefinite Optimization." In Handbook on Semidefinite, Conic and Polynomial Optimization. Springer US, 2011. http://dx.doi.org/10.1007/978-1-4614-0769-0_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bochnak, Jacek, Michel Coste, and Marie-Françoise Roy. "Polynomial or Regular Mappings with Values in Spheres." In Real Algebraic Geometry. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-662-03718-8_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Yakubov, Sasun. "Principally elliptic boundary value problems with a polynomial parameter." In Completeness of Root Functions of Regular Differential Operators. Routledge, 2021. https://doi.org/10.1201/9781315139838-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Case, John, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, and Thomas Zeugmann. "Learning a Subclass of Regular Patterns in Polynomial Time." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39624-6_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Regular polynomial"

1

Figueira, Diego, S. Krishna, Om Swostik Mishra, and Anantha Padmanabha. "Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/34.

Full text

Abstract:

The problem of whether a recursive query can be rewritten as query without recursion is a fundamental reasoning task, known as the boundedness problem. Here we study the boundedness problem for Unions of Conjunctive Regular Path Queries (UCRPQs), a navigational query language extensively used in ontology and graph database querying. The boundedness problem for UCRPQs is known to be decidable, ExpSpace-complete. Here we focus our analysis on UCRPQs using simple regular expressions, which are of high practical relevance and enjoy a lower reasoning complexity. We show that the complexity for the

APA, Harvard, Vancouver, ISO, and other styles

2

Corbin, Nicholas A., and Boris Kramer. "Computing Solutions to the Polynomial-Polynomial Regulator Problem*." In 2024 IEEE 63rd Conference on Decision and Control (CDC). IEEE, 2024. https://doi.org/10.1109/cdc56724.2024.10885897.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

LI, YONG-BIN, JING-ZHONG ZHANG, and LU YANG. "DECOMPOSING POLYNOMIAL SYSTEMS INTO STRONG REGULAR SETS." In Proceedings of the First International Congress of Mathematical Software. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812777171_0038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Dongming, and Linpeng Wang. "Decomposition of Polynomial Ideals into Triangular Regular Sequences." In ISSAC '24: International Symposium on Symbolic and Algebraic Computation. ACM, 2024. http://dx.doi.org/10.1145/3666000.3669696.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kayal, Neeraj, Chandan Saha, and Ramprasad Saptharishi. "A super-polynomial lower bound for regular arithmetic formulas." In STOC '14: Symposium on Theory of Computing. ACM, 2014. http://dx.doi.org/10.1145/2591796.2591847.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Pugh, A. C., M. Hou, and G. E. Hayton. "Input-output equivalent representation of non-regular polynomial matrix descriptions." In Proceedings of 16th American CONTROL Conference. IEEE, 1997. http://dx.doi.org/10.1109/acc.1997.610890.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Galindo, R., and A. Herrera. "Dynamic and robust regular I/O decoupling: A polynomial approach." In 1999 European Control Conference (ECC). IEEE, 1999. http://dx.doi.org/10.23919/ecc.1999.7099522.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Liping, and Guoshan Zhang. "The State Response and Controllability of Regular Polynomial Matrix Systems." In 2018 37th Chinese Control Conference (CCC). IEEE, 2018. http://dx.doi.org/10.23919/chicc.2018.8482577.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ronca, Alessandro, and Giuseppe De Giacomo. "Efficient PAC Reinforcement Learning in Regular Decision Processes." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/279.

Full text

Abstract:

Recently regular decision processes have been proposed as a well-behaved form of non-Markov decision process. Regular decision processes are characterised by a transition function and a reward function that depend on the whole history, though regularly (as in regular languages). In practice both the transition and the reward functions can be seen as finite transducers. We study reinforcement learning in regular decision processes. Our main contribution is to show that a near-optimal policy can be PAC-learned in polynomial time in a set of parameters that describe the underlying decision proces

APA, Harvard, Vancouver, ISO, and other styles

10

Hara, Seiya, and Takayoshi Shoudai. "Polynomial Time Mat Learning of C-deterministic Regular Formal Graph Systems." In 2014 IIAI 3rd International Conference on Advanced Applied Informatics (IIAIAAI). IEEE, 2014. http://dx.doi.org/10.1109/iiai-aai.2014.51.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Regular polynomial"

1

Baader, Franz, and Ralf Küsters. Unification in a Description Logic with Transitive Closure of Roles. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.115.

Full text

Abstract:

Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting redundancies in knowledge bases. It was shown that unification in the small description logic FL₀, which allows for conjunction, value restriction, and the top concept only, is already ExpTime-complete. The present paper shows that the complexity does not increase if one additionally allows for composition, union, and transitive closure of roles. It also shows that matching (which is polynomial in FL₀) is PSpace-complete in the extended description logic. These results are proved via a reduction

APA, Harvard, Vancouver, ISO, and other styles

2

Borgwardt, Stefan, Walter Forkel, and Alisa Kovtunova. Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.223.

Full text

Abstract:

Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a com

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!