Let $n,r,k\in \mathbb{N}$. An $r$-colouring of the vertices of a regular $n$-gon is any mapping $\unicode[STIX]{x1D712}:\mathbb{Z}_{n}\rightarrow \{1,2,\ldots ,r\}$. Two colourings are equivalent if one of them can be obtained from another by a rotation of the polygon. An $r$-ary necklace of length $n$ is an equivalence class of $r$-colourings of $\mathbb{Z}_{n}$. We say that a colouring is $k$-alternating if all $k$ consecutive vertices have pairwise distinct colours. We compute the smallest number $r$ for which there exists a $k$-alternating $r$-colouring of $\mathbb{Z}_{n}$ and we count, for any $r$, 2-alternating $r$-colourings of $\mathbb{Z}_{n}$ and 2-alternating $r$-ary necklaces of length $n$.
Let [Formula: see text] be a finite group and let [Formula: see text]. An [Formula: see text]-coloring of [Formula: see text] is any mapping [Formula: see text]. A coloring [Formula: see text] is symmetric if there is [Formula: see text] such that [Formula: see text] for every [Formula: see text]. We show that if [Formula: see text] is Abelian and [Formula: see text] is the polynomial representing the number of symmetric [Formula: see text]-colorings of [Formula: see text], then the number of symmetric [Formula: see text]-colorings of [Formula: see text] is [Formula: see text]. We also extend this result to the dihedral group [Formula: see text].
This review considers piecewise polynomial functions, that have long been known to be a useful and versatile tool in numerical analysis, for solving problems which have solutions with irregular features, such as steep gradients and oscillatory behaviour. Examples of piecewise polynomial functions used include splines, in particular B-splines, and Hermite functions. Spline functions are useful for obtaining global approximations whilst Hermite functions are useful for approximation over finite elements. Our aim in this review is to study quintic Hermite functions and develop a numerical collocation scheme for solving ODEs and PDEs. This choice of basis functions is further motivated by the fact that we are interested in solving problems having solutions with steep gradients and oscillatory properties, for which this approximation basis seems to be a suitable choice. We derive the quintic Hermite basis and use it to formulate the orthogonal collocation on finite element (OCFE) method. We present the error analysis for third order ODEs and derive both global and nodal error bounds to illustrate the super-convergence property at the nodes. Numerical simulations using the Julia programming language are performed for both ODEs and PDEs and enhance the theoretical results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.