Log in

Relevant bibliographies by topics / Regular polynomial / Journal articles

To see the other types of publications on this topic, follow the link: Regular polynomial.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Golasiński, Marek, and Francisco Gómez Ruiz. "Polynomial and Regular Maps into Grassmannians." K-Theory 26, no. 1 (2002): 51–68. http://dx.doi.org/10.1023/a:1016305323458.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Caughman IV, John S. "Bipartite Q -Polynomial Distance-Regular Graphs." Graphs and Combinatorics 20, no. 1 (2004): 47–57. http://dx.doi.org/10.1007/s00373-003-0538-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Dickie, Garth A. "Twice Q-Polynomial Distance-Regular Graphs." Journal of Combinatorial Theory, Series B 68, no. 1 (1996): 161–66. http://dx.doi.org/10.1006/jctb.1996.0061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

DIAO, Y., G. HETYEI, and K. HINSON. "TUTTE POLYNOMIALS OF TENSOR PRODUCTS OF SIGNED GRAPHS AND THEIR APPLICATIONS IN KNOT THEORY." Journal of Knot Theory and Its Ramifications 18, no. 05 (2009): 561–89. http://dx.doi.org/10.1142/s0218216509007075.

Full text

Abstract:

It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollobás and Riordan, we introduce a generalization of Kauffman's Tutte polynomial of signed graphs for which describing the effect of taking a signed tensor product of signed graphs is very simple. We show that this Tutte polynomial of a signed tensor product of signed graphs may be expressed in terms of the Tutte polynomials of the original signed graphs by using a simple substitution rule. Ou

APA, Harvard, Vancouver, ISO, and other styles

15

Milovanovic, Gradimir, and Abdullah Mir. "On zero inclusion regions of polynomials and regular functions of a quaternionic variable." Filomat 38, no. 13 (2024): 4791–804. https://doi.org/10.2298/fil2413791m.

Full text

Abstract:

One of the most fundamental problems in numerical mathematics is the estimation of the zeros of a polynomial. This kind of study for polynomials and regular functions of a quaternionic variable has been carried out by many authors in the recent past. In this paper, we build a framework that uses the zero sets of a regular product and the extended Schwarz?s lemma to deduce zero inclusion regions of polynomials and regular functions with quaternionic coefficients located on only one side of the powers of the quaternionic variable. The results obtained for this particular subclass of regular func

APA, Harvard, Vancouver, ISO, and other styles

16

Ahmed, Elsayed, та Dmytro Savchuk. "Endomorphisms of regular rooted trees induced by the action of polynomials on the ring ℤd of d-adic integers". Journal of Algebra and Its Applications 19, № 08 (2019): 2050154. http://dx.doi.org/10.1142/s0219498820501546.

Full text

Abstract:

We show that every polynomial in [Formula: see text] defines an endomorphism of the [Formula: see text]-ary rooted tree induced by its action on the ring [Formula: see text] of [Formula: see text]-adic integers. The sections of this endomorphism also turn out to be induced by polynomials in [Formula: see text] of the same degree. In the case of permutational polynomials acting on [Formula: see text] by bijections, the induced endomorphisms are automorphisms of the tree. In the case of [Formula: see text], such polynomials were completely characterized by Rivest in [Permutation polynomials modu

APA, Harvard, Vancouver, ISO, and other styles

17

Lewis, Heather A. "Homotopy in Q-polynomial distance-regular graphs." Discrete Mathematics 223, no. 1-3 (2000): 189–206. http://dx.doi.org/10.1016/s0012-365x(00)00045-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

De Bruyn, Bart, and Frederic Vanhove. "On Q-polynomial regular near 2d-gons." Combinatorica 35, no. 2 (2014): 181–208. http://dx.doi.org/10.1007/s00493-014-3039-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Beezer, Robert A., and E. J. Farrell. "The matching polynomial of a regular graph." Discrete Mathematics 137, no. 1-3 (1995): 7–18. http://dx.doi.org/10.1016/0012-365x(93)e0125-n.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Chen, Zhenghong, Xiaoxian Tang, and Bican Xia. "Generic regular decompositions for parametric polynomial systems." Journal of Systems Science and Complexity 28, no. 5 (2015): 1194–211. http://dx.doi.org/10.1007/s11424-015-3015-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Diki, Kamal, Sorin G. Gal, and Irene Sabadini. "Polynomial Approximation in Slice Regular Fock Spaces." Complex Analysis and Operator Theory 13, no. 6 (2018): 2729–46. http://dx.doi.org/10.1007/s11785-018-0878-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Fernando, José F., та J. M. Gamboa. "Polynomial and regular images of ℝ n". Israel Journal of Mathematics 153, № 1 (2006): 61–92. http://dx.doi.org/10.1007/bf02771779.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Miklavič, Štefko. "On bipartite Q-polynomial distance-regular graphs." European Journal of Combinatorics 28, no. 1 (2007): 94–110. http://dx.doi.org/10.1016/j.ejc.2005.09.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Deutsch, Emeric, and Juan A. Rodríguez-Velázquez. "The Hosoya polynomial of distance-regular graphs." Discrete Applied Mathematics 178 (December 2014): 153–56. http://dx.doi.org/10.1016/j.dam.2014.06.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Dickie, Garth A., and Paul M. Terwilliger. "Dual Bipartite Q-polynomial Distance-regular Graphs." European Journal of Combinatorics 17, no. 7 (1996): 613–23. http://dx.doi.org/10.1006/eujc.1996.0052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hussain, Adil. "On the Eneström-Kakeya theorem for quaternionic polynomial." Filomat 37, no. 15 (2023): 4981–90. http://dx.doi.org/10.2298/fil2315981h.

Full text

Abstract:

The main purpose of this paper is to extend various results of Enestr?m-Kakeya type from the complex to quaternionic setting by virtue of a maximum modulus theorem and the structure of the zero sets in the newly developed theory of regular functions and polynomials of a quaternionic variable. Our findings generalise several newly proven conclusions concerning the distribution of zeros of a quaternionic polynomial.

APA, Harvard, Vancouver, ISO, and other styles

27

Kochol, Martin. "Polynomials Counting Nowhere-Zero Chains Associated with Homomorphisms." Mathematics 12, no. 20 (2024): 3218. http://dx.doi.org/10.3390/math12203218.

Full text

Abstract:

A regular matroid M on a finite set E is represented by a totally unimodular matrix. The set of vectors from Z E orthogonal to rows of the matrix form a regular chain group N. Assume that ψ is a homomorphism from N into a finite additive Abelian group A and let Aψ[N] be the set of vectors g from (A−0) E , such that ∑e∈E g(e)· f(e) = ψ(f) for each f ∈ N (where · is a scalar multiplication). We show that |Aψ[N]| can be evaluated by a polynomial function of |A|. In particular, if ψ(f) = 0 for each regular matroid; regular chain group; totally unimodular matrix; homomorphism; assigning polynomial,

APA, Harvard, Vancouver, ISO, and other styles

28

HAN, YO-SUB, YAJUN WANG, and DERICK WOOD. "INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES." International Journal of Foundations of Computer Science 17, no. 02 (2006): 379–93. http://dx.doi.org/10.1142/s0129054106003887.

Full text

Abstract:

We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that w

APA, Harvard, Vancouver, ISO, and other styles

29

Beezer, Robert A., and E. J. Farrell. "The matching polynomial of a distance-regular graph." International Journal of Mathematics and Mathematical Sciences 23, no. 2 (2000): 89–97. http://dx.doi.org/10.1155/s0161171200000740.

Full text

Abstract:

A distance-regular graph of diameterdhas2dintersection numbers that determine many properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance-regular graph can also be determined from its intersection array, and that this is the maximum number of coefficients so determined. Also, the converse is true for distance-regular graphs of small diameter—that is, the intersection array of a distance-regular graph of diameter 3 or less can be determined from the matching polynomial of the graph.

APA, Harvard, Vancouver, ISO, and other styles

30

GAWRYCHOWSKI, PAWEŁ, DALIA KRIEGER, NARAD RAMPERSAD, and JEFFREY SHALLIT. "FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME." International Journal of Foundations of Computer Science 21, no. 04 (2010): 597–618. http://dx.doi.org/10.1142/s0129054110007441.

Full text

Abstract:

We give an O(n + t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. Given an NFA accepting a language of polynomial growth, we can also determine the order of polynomial growth in O(n+t) time. We also give polynomial time algorithms to solve these problems for context-free grammars.

APA, Harvard, Vancouver, ISO, and other styles

31

Fenton, Peter, Janne Grohn, Janne Heittokangas, John Rossi та Jouni Rattya. "On α-Polynomial Regular Functions, with Applications to Ordinary Differential Equations". Proceedings of the Edinburgh Mathematical Society 57, № 2 (2014): 405–21. http://dx.doi.org/10.1017/s0013091514000017.

Full text

Abstract:

AbstractThis research deals with properties of polynomial regular functions, which were introduced in a recent study concerning Wiman-Valiron theory in the unit disc. The relation of polynomial regular functions to a number of function classes is investigated. Of particular interest is the connection to the growth class Gα, which is closely associated with the theory of linear differential equations with analytic coefficients in the unit disc. If the coefficients are polynomial regular functions, then it turns out that a finite set of real numbers containing all possible maximum modulus orders

APA, Harvard, Vancouver, ISO, and other styles

32

Popescu, Gelu. "Wold decompositions for representations of C∗-algebras associated with noncommutative varieties." Journal of Operator Theory 87, no. 1 (2021): 41–81. http://dx.doi.org/10.7900/jot.2020jun29.2289.

Full text

Abstract:

Given a set Q of polynomials in noncommutative indeterminates Z1,…,Zn and a regular domain Dmp(H)⊂B(H)n, m,n∈N, associated with a positive regular polynomial p∈C⟨Z1,…,Zn⟩, we consider the variety VQ(H):={X=(X1,…,Xn)∈Dmp(H):g(X)=0 for all g∈Q}. Each variety VQ(H) admits a {\it universal model} B=(B1,…,Bn). The main goal of the paper is to study the structure of the ∗-representations of the C∗-algebra C∗(VQ) generated by B1,…,Bn and the identity.

APA, Harvard, Vancouver, ISO, and other styles

33

Gruber, Hermann, and Markus Holzer. "Language operations with regular expressions of polynomial size." Theoretical Computer Science 410, no. 35 (2009): 3281–89. http://dx.doi.org/10.1016/j.tcs.2009.04.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Pascasio, Arlene A. "A characterization of Q-polynomial distance-regular graphs." Discrete Mathematics 308, no. 14 (2008): 3090–96. http://dx.doi.org/10.1016/j.disc.2007.08.034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Miklavič, Štefko. "Q-polynomial distance-regular graphs with a1=0." European Journal of Combinatorics 25, no. 7 (2004): 911–20. http://dx.doi.org/10.1016/j.ejc.2004.02.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Dickie, Garth A. "Twice Q-polynomial distance-regular graphs are thin." European Journal of Combinatorics 16, no. 6 (1995): 555–60. http://dx.doi.org/10.1016/0195-6698(95)90037-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Klimek, Maciej. "Iteration of Analytic Multifunctions." Nagoya Mathematical Journal 162 (June 2001): 19–40. http://dx.doi.org/10.1017/s0027763000007789.

Full text

Abstract:

It is shown that iteration of analytic set-valued functions can be used to generate composite Julia sets in CN. Then it is shown that the composite Julia sets generated by a finite family of regular polynomial mappings of degree at least 2 in CN, depend analytically on the generating polynomials, in the sense of the theory of analytic set-valued functions. It is also proved that every pluriregular set can be approximated by composite Julia sets. Finally, iteration of infinitely many polynomial mappings is used to give examples of pluriregular sets which are not composite Julia sets and on whic

APA, Harvard, Vancouver, ISO, and other styles

38

Trebješanin, Marija Bliznac, and Sanda Bujačić Babić. "Polynomial \(D(4)\)-quadruples over Gaussian integers." Glasnik Matematicki 59, no. 1 (2024): 1–31. http://dx.doi.org/10.3336/gm.59.1.01.

Full text

Abstract:

A set \(\{a, b, c, d\}\) of four non-zero distinct polynomials in \(\mathbb{Z}[i][X]\) is said to be a Diophantine \(D(4)\)-quadruple if the product of any two of its distinct elements increased by 4 is a square of some polynomial in \(\mathbb{Z}[i][X]\). In this paper we prove that every \(D(4)\)-quadruple in \(\mathbb{Z}[i][X]\) is regular, or equivalently that the equation \[ (a+b-c-d)^2=(ab+4)(cd+4)\hspace{20ex} \] holds for every \(D(4)\)-quadruple in \(\mathbb{Z}[i][X]\).

APA, Harvard, Vancouver, ISO, and other styles

39

Lu, Pengli, Ke Gao, and Yang Yang. "Generalized Characteristic Polynomials of Join Graphs and Their Applications." Discrete Dynamics in Nature and Society 2017 (2017): 1–10. http://dx.doi.org/10.1155/2017/2372931.

Full text

Abstract:

The Kirchhoff index ofGis the sum of resistance distances between all pairs of vertices ofGin electrical networks.LEL(G)is the Laplacian-Energy-Like Invariant ofGin chemistry. In this paper, we define two classes of join graphs: the subdivision-vertex-vertex joinG1⊚G2and the subdivision-edge-edge joinG1⊝G2. We determine the generalized characteristic polynomial of them. We deduce the adjacency (Laplacian and signless Laplacian, resp.) characteristic polynomials ofG1⊚G2andG1⊝G2whenG1isr1-regular graph andG2isr2-regular graph. As applications, the Laplacian spectra enable us to get the formulas

APA, Harvard, Vancouver, ISO, and other styles

40

Ramane, Harishchandra S., Shaila B. Gudimani, and Sumedha S. Shinde. "Signless Laplacian Polynomial and Characteristic Polynomial of a Graph." Journal of Discrete Mathematics 2013 (January 3, 2013): 1–4. http://dx.doi.org/10.1155/2013/105624.

Full text

Abstract:

The signless Laplacian polynomial of a graph G is the characteristic polynomial of the matrix Q(G)=D(G)+A(G), where D(G) is the diagonal degree matrix and A(G) is the adjacency matrix of G. In this paper we express the signless Laplacian polynomial in terms of the characteristic polynomial of the induced subgraphs, and, for regular graph, the signless Laplacian polynomial is expressed in terms of the derivatives of the characteristic polynomial. Using this we obtain the characteristic polynomial of line graph and subdivision graph in terms of the characteristic polynomial of induced subgraphs.

APA, Harvard, Vancouver, ISO, and other styles

41

Sghaier, Mabrouk. "Some symmetric semi-classical polynomial sets." Filomat 25, no. 3 (2011): 175–89. http://dx.doi.org/10.2298/fil1103175s.

Full text

Abstract:

We show that if ? is a regular semi-classical form (linear functional), then the symmetric form u defined by the relation x?u=??? where ?u is the even part of u, is also regular and semi-classical form for every complex ? except for a discrete set of numbers depending on ?. We give explicitly the recurrence coefficients, integral representation and the structure relation coefficients of the orthogonal polynomials sequence associated with u and the class of the form u knowing that of ?. We conclude with some illustrative examples.

APA, Harvard, Vancouver, ISO, and other styles

42

ISHII, ATSUSHI. "ON NORMALIZATIONS OF A REGULAR ISOTOPY INVARIANT FOR SPATIAL GRAPHS." International Journal of Mathematics 22, no. 11 (2011): 1545–59. http://dx.doi.org/10.1142/s0129167x1100729x.

Full text

Abstract:

We give a framework to normalize a regular isotopy invariant of a spatial graph, and introduce many normalizations satisfying the same relation under a local move. We normalize the Yamada polynomial for spatial embeddings of almost all trivalent graphs without a bridge, and see the benefit to utilize our normalizations from the viewpoint of skein relations, the finite type invariants, and evaluations of the Yamada polynomial. We show that the collection of the differences between two of our normalizations is a complete spatial-graph-homology invariant.

APA, Harvard, Vancouver, ISO, and other styles

43

GEBAUER, HEIDI, and YOSHIO OKAMOTO. "FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES." International Journal of Foundations of Computer Science 20, no. 01 (2009): 25–44. http://dx.doi.org/10.1142/s0129054109006437.

Full text

Abstract:

We prove # P -completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O *(1.8494m) time for 3-regular graphs, and O *(1.9706m) time for unit interval graphs, where m is the number of edges in the graph and O *-notation ignores a polynomial factor. The algorithms can be generalized to the Tutte polynomial computation.

APA, Harvard, Vancouver, ISO, and other styles

44

Isakov, V. N. "Optimum regular local spline interpolation of signals." Journal of «Almaz – Antey» Air and Space Defence Corporation, no. 4 (December 30, 2016): 24–31. http://dx.doi.org/10.38013/2542-0542-2016-4-24-31.

Full text

Abstract:

The study deals with an optimum approach to regular local signal interpolation by means of generalised splines. For the special case of local regular polynomial spline interpolation we derive quasi-optimal interpolation bases and provide corresponding recommendations dealing with selecting interpolation order and order of smoothness.

APA, Harvard, Vancouver, ISO, and other styles

45

Luo, Miao, and Liang Liang Ma. "Calculating Methods for the Irregular Hermite Interpolation Polynomial." Advanced Materials Research 765-767 (September 2013): 620–24. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.620.

Full text

Abstract:

Based on the theory of the regular Hermite interpolation polynomial, several calculating methods including basic function, multiple difference quotients, etc., have been proposed to solve the complex irregular Hermite interpolation polynomial.

APA, Harvard, Vancouver, ISO, and other styles

46

Bedford, Eric, and Mattias Jonsson. "Dynamics of regular polynomial endomorphisms of C k [superscript]." American Journal of Mathematics 122, no. 1 (2000): 153–212. http://dx.doi.org/10.1353/ajm.2000.0001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Alghamdi, Azza, Maciej Klimek, and Marta Kosek. "Attractors of Compactly Generated Semigroups of Regular Polynomial Mappings." Complexity 2018 (November 11, 2018): 1–11. http://dx.doi.org/10.1155/2018/5698021.

Full text

Abstract:

We investigate the metric space of pluriregular sets as well as the contractions on that space induced by infinite compact families of proper polynomial mappings of several complex variables. The topological semigroups generated by such families, with composition as the semigroup operation, lead to the constructions of a variety of Julia-type pluriregular sets. The generating families can also be viewed as infinite iterated function systems with compact attractors. We show that such attractors can be approximated both deterministically and probabilistically in a manner of the classic chaos gam

APA, Harvard, Vancouver, ISO, and other styles

48

Pascasio, Arlene A. "Tight Distance-Regular Graphs and the Q-Polynomial Property." Graphs and Combinatorics 17, no. 1 (2001): 149–69. http://dx.doi.org/10.1007/s003730170063.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Ma, JianMin, and Jack H. Koolen. "Twice Q-polynomial distance-regular graphs of diameter 4." Science China Mathematics 58, no. 12 (2014): 2683–90. http://dx.doi.org/10.1007/s11425-014-4958-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Case, John, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, and Thomas Zeugmann. "Learning a subclass of regular patterns in polynomial time." Theoretical Computer Science 364, no. 1 (2006): 115–31. http://dx.doi.org/10.1016/j.tcs.2006.07.044.

Full text

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!