Search

Teaching music often focuses on developing musical concepts, through comparisons and discriminations. This paper contributes to the discussion on concept development in music through recognition of common elements in a situation and a shift from a local to a general level, considering theoretical approaches to mathematical generalisation. It sets to explore preschool children's understanding of tempo and its use in new musical situations. The research involved a musical intervention in six preschool classrooms. Critical incidences from focus group discussions and non-participant observation recorded children's understanding of tempo from their musical actions, drawings, responses and reflection to teacher questions. The findings highlight that children could go beyond the specific content of the activities and focus on the basic characteristics of tempo, integrating them into their song creations. A teaching approach oriented to generalisation through concept development can assist teachers to elaborate musical content and realise students' level of understanding. [ABSTRACT FROM AUTHOR]

It is well-known that the famous Selberg integral is equivalent to the Morris constant term identity. In 1998, Baker and Forrester conjectured a generalization of the q-Morris constant term identity[J. Combin. Theory Ser. A 81 (1998), pp. 69–87]. This conjecture was proved and extended by Károlyi, Nagy, Petrov, and Volkov (KNPV) in 2015 [Adv. Math. 277 (2015), pp. 252–282]. In this paper, we obtain two symmetric function generalizations of the q-Baker–Forrester ex-conjecture. These include: (i) a q-Baker–Forrester type constant term identity for a product of a complete symmetric function and a Macdonald polynomial; (ii) a complete symmetric function generalization of KNPV's result. [ABSTRACT FROM AUTHOR]

In this paper, we generalize the Avalanche Principle in [Ann. of. Math. (2), 2001, 154(1): 155–203]. [ABSTRACT FROM AUTHOR]

An $(r, \delta)$ -locally repairable code ($(r, \delta)$ -LRC for short) was introduced by Prakash et al. for tolerating multiple failed nodes in distributed storage systems, which was a generalization of the concept of $r$ -LRCs produced by Gopalan et al.. An $(r, \delta)$ -LRC is said to be optimal if it achieves the Singleton-like bound. Recently, Chen et al. generalized the construction of cyclic $r$ -LRCs proposed by Tamo et al. , and constructed several classes of optimal $(r, \delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively in terms of a union of the set of zeros controlling the minimum distance and the set of zeros ensuring the locality. Following the work of , , this paper first characterizes $(r, \delta)$ -locality of a cyclic code via its zeros. Then we construct several classes of optimal cyclic $(r, \delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively from the product of two sets of zeros. Our constructions include all optimal cyclic $(r,\delta)$ -LRCs proposed in , , and our method seems more convenient to obtain optimal cyclic $(r, \delta)$ -LRCs with flexible parameters. Moreover, many optimal cyclic $(r,\delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively with $(r+\delta -1)\nmid n$ can be obtained from our method. [ABSTRACT FROM AUTHOR]

If $ P(z)=a_n\prod _{v=1}^{n}(z-z_v) $ P (z) = a n ∏ v = 1 n (z − z v) is a polynomial of degree n having all its zeros in $ |z|\le k, k\ge 1 $ | z | ≤ k , k ≥ 1 then Aziz [Inequalities for the derivative of a polynomial. Proc Am Math Soc. 1983;89(2):259–266] proved that \[ \max_{|z|=1}|P'(z)|\ge \frac{2}{1+k^n}\sum_{v=1}^{n}\frac{k}{k+|z_v|}\max_{|z|=1}|P(z)|. \] max | z | = 1 | P ′ (z) | ≥ 2 1 + k n ∑ v = 1 n k k + | z v | max | z | = 1 | P (z) |. Recently, Kumar [On the inequalities concerning polynomials. Complex Anal Oper Theory. 2020;14(6):1–11 (Article ID 65)] established a generalization of this inequality and proved under the same hypothesis for a polynomial $ P(z)=a_0+a_1z+a_2z^2+\cdots +a_nz^n=a_n\prod _{v=1}^{n}(z-z_v) $ P (z) = a 0 + a 1 z + a 2 z 2 + ⋯ + a n z n = a n ∏ v = 1 n (z − z v) , that $$\begin{align*} & \max_{|z|=1}|P'(z)| \\ & \ge \left(\frac{2}{1+k^n}+\frac{(|a_n|k^n-|a_0|)(k-1)}{(1+k^n)(|a_n|k^n+k|a_0|)}\right)\sum_{v=1}^{n}\frac{k}{k+|z_v|}\max_{|z|=1}|P(z)|. \end{align*} $$ max | z | = 1 | P ′ (z) | ≥ (2 1 + k n + (| a n | k n − | a 0 |) (k − 1) (1 + k n) (| a n | k n + k | a 0 |)) ∑ v = 1 n k k + | z v | max | z | = 1 | P (z) |. In this paper, we sharpen the above inequalities and further extend the obtained results to the polar derivative of a polynomial. As a consequence, our results also sharpens considerably some results of Dewan and Upadhye [Inequalities for the polar derivative of a polynomial. J Ineq Pure Appl Math. 2008;9:1–9 (Article ID 119)]. [ABSTRACT FROM AUTHOR]

Let k ≥ 2. A generalization of the well-known Pell sequence is the k-Pell sequence whose first k terms are 0,..., 0, 1 and each term afterwards is given by the linear recurrence p n (k) = 2 P n − 1 (k) + P n − 2 (k) + ⋯ + P n − k (k) . The goal of this paper is to show that 11, 33, 55, 88 and 99 are all repdigits expressible as sum or difference of two k-Pell. The proof of our main theorem uses lower bounds for linear forms in logarithms of algebraic numbers and a modified version of Baker-Davenport reduction method (due to Dujella and Pethő). This extends a result of Bravo and Herrera [Repdigits in generalized Pell sequences, Arch. Math. (Brno) 56(4) (2020), 249–262]. [ABSTRACT FROM AUTHOR]

In this note, we slightly generalize Theorem 2 in the paper by M. Tunç and point out that the assumption of Theorem 3 is not sufficient. A misuse of the term 'mean' is also discussed. [ABSTRACT FROM AUTHOR]

For rational functions , where is a polynomial of degree at the most and , with we use simple but elegant techniques to strengthen generalizations of certain results which extend some widely known polynomial inequalities of Erdős-Lax and Turán to rational functions . In return these reinforced results, in the limiting case, lead to the corresponding refinements of the said polynomial inequalities. As an illustration and as an application of our results, we obtain some new improvements of the Erdős-Lax and Turán type inequalities for polynomials. These improved results take into account the size of the constant term and the leading coefficient of the given polynomial. As a further factor of consideration, during the course of this paper we will demonstrate how some recently obtained results could have been proved without invoking the results of Dubinin [Distortion theorems for polynomials on the circle, Sb. Math. 191(12) (2000) 1797–1807]. [ABSTRACT FROM AUTHOR]

In this paper, we give the generalization of Cauchy–Binet, Laplace, Sylvester and generalized Dodgson's condensation formulas for the case of rectangular determinants. The proofs are bijective combinatorial proofs similar to that of Zeilberger's paper [Zeilberger D. Dodgson's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN. Electron J Comb. 1997;4(2):R22; Zeilberger D. A combinatorial approach to matrix algebra. Discrete Math. 1985;56:61–72]. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of computing the rank of a block-structured symbolic matrix (a generic partitioned matrix) A = (A α β x α β) , where A α β is a 2 × 2 matrix over a field F and x α β is an indeterminate for α = 1 , 2 , ⋯ , μ and β = 1 , 2 , ⋯ , ν . This problem can be viewed as an algebraic generalization of the bipartite matching problem and was considered by Iwata and Murota (SIAM J Matrix Anal Appl 16(3):719–734, 1995). Recent interests in this problem lie in the connection with non-commutative Edmonds' problem by Ivanyos et al. (Comput Complex 27:561–593, 2018) and Garg et al. (Found. Comput. Math. 20:223–290, 2020), where a result by Iwata and Murota implicitly states that the rank and non-commutative rank (nc-rank) are the same for this class of symbolic matrices. The main result of this paper is a simple and combinatorial O ((μ ν) 2 min { μ , ν }) -time algorithm for computing the symbolic rank of a (2 × 2) -type generic partitioned matrix of size 2 μ × 2 ν . Our algorithm is inspired by the Wong sequence algorithm by Ivanyos et al. for the nc-rank of a general symbolic matrix, and requires no blow-up operation, no field extension, and no additional care for bounding the bit-size. Moreover it naturally provides a maximum rank completion of A for an arbitrary field F . [ABSTRACT FROM AUTHOR]

Over the past few decades, Piaget's forms of abstraction have proved productive for developing explanatory models of student and teacher knowledge, yet the broader applicability of his abstraction forms to mathematics education remains an open question. In this paper, we adopt the Piagetian forms of abstraction to accomplish two interrelated goals. Firstly, we analyze instructional tasks to develop hypothetical accounts of the abstractions that might occur during students' engagement with them. Secondly, we draw on middle- and secondary-grades classroom data to discuss the abstractions that occurred during the implementation of those instructional tasks. Because this paper represents an initial attempt at extending the applicability of Piagetian forms of abstraction, we close with potential implications of such use and possible avenues for future research. Most notably, we highlight the complexities involved in supporting abstraction through curriculum and instruction. • We examine task materials and implementation. • We differentiate between forms of abstraction. • We identify abstraction's viability for such analysis. • We differentiate between student learning outcomes. • We suggest avenues for future research. [ABSTRACT FROM AUTHOR]

Hovey and Palmieri [ The structure of the Bousfield lattice , Amer. Math. Soc., Providence, RI, 1999] proposed the retract conjecture on the Bousfield lattice of the stable homotopy category. The author, Shimomura and Tatehara [Publ. Res. Inst. Math. Sci. 50 (2014), pp. 497–513] defined the notion of monoidal posets as a generalization of the Bousfield lattice. In this paper, we prove that an analogue of the retract conjecture holds on a sublattice of monoidal posets. [ABSTRACT FROM AUTHOR]

Let k ≥ 2 . A generalization of the well-known Pell sequence is the k-Pell sequence. For this sequence, the first k terms are 0 , ... , 0 , 1 and each term afterwards is given by the linear recurrence P n (k) = 2 P n - 1 (k) + P n - 2 (k) + ⋯ + P n - k (k). In this paper, we extend the previous work (Rihane and Togbé in Ann Math Inform 54:57–71, 2021) and investigate the Padovan and Perrin numbers in the k-Pell sequence. [ABSTRACT FROM AUTHOR]

In this paper a multiplier theorem in the Hardy space H^1(\mathbb {T}) associated with Jacobi expansions of exponential type is proved, that is, a bilateral sequence \left \{\lambda _n\right \}_{n=-\infty }^{\infty } is a multiplier from H^1(\mathbb {T}) into the sequence space \ell ^1(\mathbb {Z}) associated with Jacobi expansions of exponential type, if \[ \sup _N\sum _{k=1}^{\infty }\left (\sum _{kN<|j|\le (k+1)N}|\lambda _j|\right)^2<\infty.\] This is a generalization of a multiplier theorem on usual Fourier expansions in the Hardy space H^1(\mathbb {T}), and for \lambda _n=(|n|+1)^{-1}, a Hardy type inequality for Jacobi expansions is immediate which has ever been proved by Kanjin and Sato [Math. Inequal. Appl. 7 (2004), pp. 551–555]. [ABSTRACT FROM AUTHOR]

In this paper, we prove that klt singularities are invariant under deformations if the generic fiber is Q-Gorenstein. We also obtain a similar result for slc singularities. These are generalizations of results of Esnault-Viehweg [Math. Ann. 271 (1985), 439-449] and S. Ishii [Math. Ann. 275 (1986), 139-148; Singularities (Iowa City, IA, 1986) Contemporary Mathematics, vol. 90 (American Mathematical Society, Providence, RI, 1989), 135-145]. [ABSTRACT FROM AUTHOR]

We enter the details of two recent articles concerning as many chemotaxis models, one nonlinear and the other linear, and both with produced chemoattractant and saturated chemorepellent. More precisely, we are referring respectively to the papers "Boundedness in a nonlinear attraction‐repulsion Keller–Segel system with production and consumption," by S. Frassu, C. van der Mee and G. Viglialoro [J. Math. Anal. Appl.504(2):125428, 2021] and "Boundedness in a chemotaxis system with consumed chemoattractant and produced chemorepellent," by S. Frassu and G. Viglialoro [Nonlinear Anal.213:112505, 2021]. These works, when properly analyzed, leave open room for some improvement of their results. We generalize the outcomes of the mentioned articles, establish other statements, and put all the claims together; in particular, we select the sharpest ones and schematize them. Moreover, we complement our research also when logistic sources are considered in the overall study. [ABSTRACT FROM AUTHOR]

For a compact set A \subset \mathbb {R}^d and an integer k\ge 1, let us denote by \begin{equation*} A[k] = \left \{a_1+\cdots +a_k: a_1, \ldots, a_k\in A\right \}=\sum _{i=1}^k A \end{equation*} the Minkowski sum of k copies of A. A theorem of Shapley, Folkmann and Starr (1969) states that \frac {1}{k}A[k] converges to the convex hull of A in Hausdorff distance as k tends to infinity. Bobkov, Madiman and Wang [ Concentration, functional inequalities and isoperimetry , Amer. Math. Soc., Providence, RI, 2011] conjectured that the volume of \frac {1}{k}A[k] is nondecreasing in k, or in other words, in terms of the volume deficit between the convex hull of A and \frac {1}{k}A[k], this convergence is monotone. It was proved by Fradelizi, Madiman, Marsiglietti and Zvavitch [C. R. Math. Acad. Sci. Paris 354 (2016), pp. 185–189] that this conjecture holds true if d=1 but fails for any d \geq 12. In this paper we show that the conjecture is true for any star-shaped set A \subset \mathbb {R}^d for d=2 and d=3 and also for arbitrary dimensions d \ge 4 under the condition k \ge (d-1)(d-2). In addition, we investigate the conjecture for connected sets and present a counterexample to a generalization of the conjecture to the Minkowski sum of possibly distinct sets in \mathbb {R}^d, for any d \geq 7. [ABSTRACT FROM AUTHOR]

Reliability evaluation of interconnection networks is of significant importance to the design and maintenance of interconnection networks. The component connectivity is an important parameter for the reliability evaluation of interconnection networks and is a generalization of the traditional connectivity. The |$g$| -component connectivity |$c\kappa _g (G)$| of a non-complete connected graph |$G$| is the minimum number of vertices whose deletion results in a graph with at least |$g$| components. Determining the |$g$| -component connectivity is still an unsolved problem in many interconnection networks. Let |$Q_{n,k}$| (⁠|$1\leq k\leq n-1$|⁠) denote the |$(n, k)$| -enhanced hypercube. In this paper, let |$n\geq 7$| and |$1\leq k \leq n-5$|⁠ , we determine |$c\kappa _{g}(Q_{n,k}) = g(n + 1) - \frac{1}{2}g(g + 1) + 1$| for |$2 \leq g \leq n$|⁠. The previous result in Zhao and Yang (2019, Conditional connectivity of folded hypercubes. Discret. Appl. Math. , 257 , 388–392) is extended. [ABSTRACT FROM AUTHOR]

In a short fragment published for the first time with his lost notebook in 1988 (Ramanujan, The lost notebook and other unpublished papers (Narosa, New Delhi, 1988)), Ramanujan offered two beautiful identities, associated, respectively, with the classical circle and divisor problems. In fact, they are analogues, with an additional variable, but not generalizations, of classical identities associated with these two famous problems. After Ramanujan's death in 1920, the lost notebook and fragments of papers of Ramanujan were sent to Hardy. We do not have any official record of what was included in this mailing, but it is likely that the aforementioned fragment was included in this parcel. If so, then it is possible that Ramanujan wrote it at the end of his life in either 1919 or 1920. On the other hand, from a paper that Hardy published in 1915 (Hardy, Quart. J. Math. (Oxford) 46 (1915) 263–283) on the circle problem, we are aware that by early in his stay in England, Ramanujan had a strong interest in these problems, and so the fragment may emanate from this period. Two of the present authors and Kim published a proof of the identity connected with the circle problem in 2013 (Berndt, Kim and Zaharescu, Adv. Math. 236 (2013) 24–59). In this paper, a proof of the second identity is given for the first time. [ABSTRACT FROM AUTHOR]

Makeenko and Migdal (Phys Lett B 88(1):135–137, 1979) gave heuristic identities involving the expectation of the product of two Wilson loop functionals associated to splitting a single loop at a self-intersection point. Kazakov and Kostov (Nucl Phys B 176(1):199–215, 1980) reformulated the Makeenko–Migdal equations in the plane case into a form which made rigorous sense. Nevertheless, the first rigorous proof of these equations (and their generalizations) was not given until the fundamental paper of Lévy (2017). Subsequently Driver, Kemp, and Hall Commun. Math. Phys. 351(2), 741–774 (2017) gave a simplified proof of Lévy's result and then with Driver, Gabriel, Kemp, and Hall Commun. Math. Phys. 352(3), 967–978 (2017) we showed that these simplified proofs extend to the Yang–Mills measure over arbitrary compact surfaces. All of the proofs to date are elementary but tricky exercises in finite dimensional integration by parts. The goal of this article is to give a rigorous functional integral proof of the Makeenko–Migdal equations guided by the original heuristic machinery invented by Makeenko and Migdal. Although this stochastic proof is technically more difficult, it is conceptually clearer and explains "why" the Makeenko–Migdal equations are true. It is hoped that this paper will also serve as an introduction to some of the problems involved in making sense of quantizing Yang–Mill's fields. [ABSTRACT FROM AUTHOR]

For two graphs $F$ and $H$, the relative Turán number ${ex}(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Foucaud, Krivelevich, and Perarnau [SIAM J. Discrete Math., 29 (2015), pp. 65--78] and Perarnau and Reed [Combin. Probab. Comput., 26 (2017), pp. 448--467] studied these quantities as a function of the maximum degree of $H$. In this paper, we study a generalization for uniform hypergraphs. If $F$ is a complete $r$-partite $r$-uniform hypergraph with parts of sizes $s_1,s_2,\dots,s_r$ with each $s_{i + 1}$ sufficiently large relative to $s_i$, then with $1/\beta = \sum_{i = 2}^r \prod_{j = 1}^{i - 1} s_j$ we prove that for any $r$-uniform hypergraph $H$ with maximum degree $\Delta$, ${ex}(H,F)\ge \Delta^{-\beta - o(1)} \cdot e(H).$ This is tight as $\Delta \rightarrow \infty$ up to the $o(1)$ term in the exponent, since we show there exists a $\Delta$-regular $r$-graph $H$ such that ${ex}(H,F)=O(\Delta^{-\beta}) \cdot e(H)$. Similar tight results are obtained when $H$ is the random $n$-vertex $r$-graph $H_{n,p}^r$ with edge-probability $p$, extending results of Balogh and Samotij [J. Lond. Math. Soc., 83 (2011), pp. 1091--1094] and Morris and Saxton [Adv. Math., 298 (2016), pp. 534--580]. General lower bounds for a wider class of $F$ are also obtained. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to define a q‐analogue of a parametric generalization of Baskakov operators introduced by Aral and Erbay (Math. Commun. 24(1) (2019), 119‐131). We establish some local direct results for these operators by means of the modulus of continuity and the Peetre's K‐functional. Weighted approximation properties are also established. Next, we construct a bivariate case of the above q‐operators and determine the rate of convergence in terms of the moduli of continuity. A Voronovskaja‐type theorem is derived too. Further, we study the rate of approximation of Bögel continuous and Bögel differentiable functions by the associated generalized Boolean sum (GBS) operators with the aid of mixed modulus of smoothness. We illustrate the rate of approximation of the q‐operators, their bivariate, and the GBS cases by means of graphics and tables and show that the GBS operators provide better rate of convergence than the bivariate operators. [ABSTRACT FROM AUTHOR]

This paper formulates a support vector machine with quantile hyper-spheres (QHSVM) for pattern classification. The idea of QHSVM is to build two quantile hyper-spheres with the same center for positive or negative training samples. Every quantile hyper-sphere is constructed by using pinball loss instead of hinge loss, which makes the new classification model be insensitive to noise, especially the feature noise around the decision boundary. Moreover, the robustness and generalization of QHSVM are strengthened through maximizing the margin between two quantile hyper-spheres, maximizing the inner-class clustering of samples and optimizing the independent quadratic programming for a target class. Besides that, this paper proposes a novel local center-based density estimation method. Based on it, ρ-QHSVM with surrounding and clustering samples is given. Under the premise of high accuracy, the execution speed of ρ-QHSVM can be adjusted. The experimental results in artificial, benchmark and strip steel surface defects datasets show that the QHSVM model has distinct advantages in accuracy and the ρ-QHSVM model is fit for large-scale datasets. [ABSTRACT FROM AUTHOR]

In this paper, we firstly obtain a new generalized identity for Riemann-Liouville fractional integrals. Then, utilizing this equality, we obtain some Midpoint type inequalities for convex and concave functions. We also give several remarks and corollaries as spacial cases. [ABSTRACT FROM AUTHOR]

For arbitrary monoids A and B, in Cevik et al. (Hacet J Math Stat 2019:1–11, 2019), it has been recently defined an extended version of the general product under the name of a higher version of Zappa products for monoids (or generalized general product) A ⊕ B δ ⋈ ψ B ⊕ A and has been introduced an implicit presentation as well as some theories in terms of finite and infinite cases for this product. The goals of this paper are to present some algebraic structures such as regularity, inverse property, Green's relations over this new generalization, and to investigate some other properties and the product obtained by a left restriction semigroup and a semilattice. [ABSTRACT FROM AUTHOR]

It was shown by Fock and Goncharov (Dual Teichmüller and lamination spaces. Handbook of Teichmüller Theory, 2007), and Fomin et al. (Acta Math 201(1):83–146, 2008) that some cluster algebras arise from triangulated orientable surfaces. Subsequently, Dupont and Palesi (J Algebraic Combinatorics 42(2):429–472, 2015) generalised this construction to include unpunctured non-orientable surfaces, giving birth to quasi-cluster algebras. In Wilson (Int Math Res Notices 341, 2017) we linked this framework to Lam and Pylyavskyy's Laurent phenomenon algebras (J Math 4(1):121–162, 2016), showing that unpunctured surfaces admit an LP structure. In this paper we extend quasi-cluster algebras to include punctured surfaces. Moreover, by adding laminations to the surface we demonstrate that all punctured and unpunctured surfaces admit LP structures. In short, we link two constructions which arose as seemingly unrelated generalisations of cluster algebras—one of the generalisations (quasi-cluster algebras) being based on triangulated surfaces, and the other (Laurent phenomenon algebras) based on the Laurent phenomenon. We thus provide a rich class of geometric examples in which to help study Laurent phenomenon algebras. [ABSTRACT FROM AUTHOR]

In 1977, Colville, Davis, and Keimel [Positive derivations on f-rings, J. Aust. Math. Soc. Ser. A 23 1977, 3, 371–375] proved that a positive derivation on an Archimedean f-algebra A has its range in the set of nilpotent elements of A. The main objective of this paper is to obtain a generalization of the above Colville, Davis and Keimel result to general derivations. Moreover, we give a new version of the Singer–Wermer conjecture for the class of second-order derivations acting on uniformly complete almost f-algebras. [ABSTRACT FROM AUTHOR]

This paper defines a generalization of the recursive Bayesian estimate (RBE), within the mathematical possibility theory. This generalization is motivated by the fact that the classical RBE, by design, deals only with random variables and can only provide closed-form solution for a few cases. The possibilistic generalization is based on the random-fuzzy variables, thus allowing one to take into account, in a very natural way, both random and systematic contributions to the uncertainty and to implement the RBE for any distribution of system state variables in a simple way. This paper illustrates the advantages of the proposed generalization, by presenting both the theoretical development, and a detailed application example. [ABSTRACT FROM AUTHOR]

Topology is one of the classical subjects in Mathematics. A lot of researchers have published their ideas.As a generalization of topological concepts many new kind of closed and open sets are published continuously. Salama presented Neutrosophic topological spaces by using Smarandache 's Neutrosophic sets. Many Researchers introduced so many closed sets in Neutrosophic topological spaces. Purpose of this research paper is we introduce Neutrosophic g*-Closed sets and Neutrosophicg*-open sets in Neutrosophic topological spaces. Also we study about study about mappings of Neutrosophic g*-Closed sets [ABSTRACT FROM AUTHOR]

A numerical semigroup is a submonoid of N with finite complement in N . A generalized numerical semigroup is a submonoid of N d with finite complement in N d . In the context of numerical semigroups, Wilf's conjecture is a long standing open problem whose study has led to new mathematics and new ways of thinking about monoids. A natural extension of Wilf's conjecture, to the class of C -semigroups, was proposed by García-García, Marín-Aragón, and Vigneron-Tenorio. In this paper, we propose a different generalization of Wilf's conjecture, to the setting of generalized numerical semigroups, and prove the conjecture for several large families including the irreducible, symmetric, and monomial case. We also discuss the relationship of our conjecture to the extension proposed by García-García, Marín-Aragón, and Vigneron-Tenorio. [ABSTRACT FROM AUTHOR]

Classical Castelnuovo Lemma shows that the number of linearly independent quadratic equations of a nondegenerate irreducible projective variety of codimension c is at most (c + 1 2) {{{c+1}\choose{2}}} and the equality is attained if and only if the variety is of minimal degree. Also G. Fano's generalization of Castelnuovo Lemma implies that the next case occurs if and only if the variety is a del Pezzo variety. Recently, these results are extended to the next case in [E. Park, On hypersurfaces containing projective varieties, Forum Math. 27 2015, 2, 843–875]. This paper is intended to complete the classification of varieties satisfying at least (c + 1 2) - 3 {{{c+1}\choose{2}}-3} linearly independent quadratic equations. Also we investigate the zero set of those quadratic equations and apply our results to projective varieties of degree ≥ 2 ⁢ c + 1 {\geq 2c+1}. [ABSTRACT FROM AUTHOR]

In (Brzdęk and Schwaiger in Aeq Math 92: 975–991, 2018) solutions of far reaching generalizations of the so-called radical functional equation f (p (π (x) + π (y))) = f (x) + f (y) have been investigated. These investigations are continued here by analysing the corresponding stability results, which have been the main subject of several recent papers. We propose a very general and uniform approach. [ABSTRACT FROM AUTHOR]

Işık et al. (Mathematics 7:862, 2019) presented an interesting generalization of the Banach contraction principle. In this paper, motivated by Işık et al., we give a new extension of the well-known Darbo inequality in a Banach space. Our results provide several generalizations of the Darbo inequality. As an application, we study the existence of solutions for a system of functional integral equations in C [ 0 , T ] . Finally, we expose a genuine example to support the effectiveness of our results. [ABSTRACT FROM AUTHOR]

This paper is devoted to the conception of mathematical objects and methods according to d'Alembert. We first recall his vision of the place of mathematics in the knowledge of nature, then the internal hierarchy of the various fields of this science, based on their degree of abstraction from sensations (§1 and 2). Then we come to the ideas of definitions, primitive ideas , simple ideas , and their generation as well as their generalization (§3 and 4). Then, having looked at what he means by quantities, numbers, quantities, as well as his conception of the objects and rules of algebra as abstract ideas by generalization (§5), we approach the question of the reality of mathematical objects with the example of the irrational (§6). The following paragraphs of the text are devoted to the difficulties encountered in various fields and the way d'Alembert tries to solve them: algebra and negative quantities (§7); principles of geometry (§8); the notion of limit as the basis of infinitesimal calculus (§9). His reflections, even if unfinished, were not without posterity (§10). [ABSTRACT FROM AUTHOR]

Let S ⊆ V (G) and κ G (S) denote the maximum number r of edge-disjoint trees T 1 , T 2 , ... , T r in G such that V (T i) ∩ V (T j) = S for any i , j ∈ { 1 , 2 , ... , r } and i ≠ j ⁠. For an integer k with 2 ≤ k ≤ n ⁠ , the generalized k-connectivity of a graph G is defined as κ k (G) = min { κ G (S) | S ⊆ V (G) and | S | = k } ⁠. The generalized k -connectivity is a generalization of the traditional connectivity. In this paper, the generalized 3-connectivity of the (n , k)-bubble-sort graph B n , k is studied for 2 ≤ k ≤ n − 1 ⁠. We show that κ 3 (B n , k) = n − 2 for 2 ≤ k ≤ n − 1 ⁠ , which generalizes the known result about the bubble-sort graph B n (Li, S. Tu, J. and Yu, C. (2016) The generalized 3-connectivity of star graphs and bubble-sort graphs. Appl. Math. Comput. 274 , 41–46), as the bubble-sort graph B n is the special (n , k) -bubble-sort graph for k = n − 1 ⁠. [ABSTRACT FROM AUTHOR]

Suggested by the max‐product sampling operators based on sinc‐Fejér kernels, in this paper, we introduce truncated max‐product Kantorovich operators based on generalized type kernels depending on two functions ϕ and ψ satisfying a set of suitable conditions. Pointwise convergence, quantitative uniform convergence in terms of the moduli of continuity, and quantitative Lp‐approximation results in terms of a K‐functional are obtained. Previous results in sampling and neural network approximation are recaptured, and new results for many concrete examples are obtained. [ABSTRACT FROM AUTHOR]

Energy efficiency in irrigation distribution networks can be estimated by following the method proposed by Abadia et al (2008) [Biosystems Engineering, 101, 21–27], in which energy efficiency is quantified in terms of global energy efficiency (GEE), a parameter that is a compound of the pumping energy efficiency (PEE) and the supply energy efficiency (SEE). PEE is related to pump functioning, while SEE is related to the design and management of the distribution system. Calculation of SEE by this method is limited to irrigation networks that have a single water intake at an elevation below that of the irrigated area and a single supplied sector. Results from the method are confusing for networks with more than one water supply point or irrigation sectors supplied by intakes located at elevations higher than that of the irrigated area. This paper proposes a modification of the earlier method that is appropriate to any type of layout and configuration of the irrigation network, with one or several water intake points and supplied sectors. The new model is applied to four different types of collective pressurised irrigation network, and the results are compared with those of the previous model. The influence of different measures taken to improve the SEE and determine the variables that affect this efficiency was analysed. The results show that adequate SEE values can be obtained with the proposed model for all the situations analysed, and that it is possible to quantify the improvements in SEE with the model. Highlights • Knowing the energy efficiency of a network can improve design and energy management. • Previous Supply Energy Efficiency (SEE) definition unfit for some network designs. • New method proposed and applied to four distribution networks. • New method is coherent and appropriate for all networks designs. • New SEE definition allows for identification of badly designed or managed networks. [ABSTRACT FROM AUTHOR]

The aim of this paper is to continue the study of generalizations of locally closed sets and investigate the classes of πgl-continuous functions in a topological space. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the notion of a left-symmetric bialgebroid as a geometric generalization of a left-symmetric bialgebra and construct a left-symmetric bialgebroid from a pseudo-Hessian manifold. We also introduce the notion of a Manin triple for left-symmetric algebroids, which is equivalent to a left-symmetric bialgebroid. The corresponding double structure is a pre-symplectic algebroid rather than a left-symmetric algebroid. In particular, we establish a relation between Maurer–Cartan type equations and Dirac structures of the pre-symplectic algebroid which is the corresponding double structure for a left-symmetric bialgebroid. [ABSTRACT FROM AUTHOR]

In this paper, some coupled fixed point stability results for one and two metrics are obtained in complete metric spaces by using some general contractive conditions some of which involve comparison functions. Our results are generalizations and exten- sions of [M.O. Olatinwo: Some stability results in complete metric space, Acta Univ. Palack. Olomuc. Fac. Rerum Natur. Math., 48(2009), 83-92] and [M.O. Olatinwo: Stability of coupled fixed point iterations and the continuous dependence of coupled fixed points, Comm. Appl. Nonlinear Anal., 19(2012), No. 2, 71-83] as well as some others in the literature. [ABSTRACT FROM AUTHOR]

A matching in a hypergraph H is a set of pairwise disjoint hyperedges. The matching number ν ( H ) of H is the size of a maximum matching in H . A subset D of vertices of H is a dominating set of H if for every v ∈ V ∖ D there exists u ∈ D such that u and v lie in an hyperedge of H . The cardinality of a minimum dominating set of H is the domination number of H , denoted by γ ( H ) . It was proved that γ ( H ) ≤ ( r − 1 ) ν ( H ) for r -uniform hypergraphs and the 2-uniform hypergraphs (graphs) achieving equality γ ( H ) = ν ( H ) have been characterized. In this paper we generalize the inequality γ ( H ) ≤ ( r − 1 ) ν ( H ) to arbitrary hypergraph of rank r and we completely characterize the extremal hypergraphs H of rank 3 achieving equality γ ( H ) = ( r − 1 ) ν ( H ) . [ABSTRACT FROM AUTHOR]

In this paper, the concept of essentially critically compressible modules are introduced, and related properties are investigated. The concept of essentially critically compressible modules are generalization of critically compressible modules discussed by Zelmanowitz. We have also provided some characterization of critically compressible modules in terms of CS modules, nonsingular modules, continuous modules and cyclic modules. [ABSTRACT FROM AUTHOR]

Through discussion of several authors, dealing with the process of mathematicization of the economy, we seek to clarify the progress of this process in the world. Mirowski (1991) analyzes this phenomenon and finds that it began more strongly from 1925. However, he does not show in his article as mathematics and physics qualitatively influenced the economy. This is our primary goal in this paper: an account, in a systematic way, of how mathematics and physics have influenced constitution of economics, culminating in the adoption of general equilibrium as metatheory and the generalization of the hypothetical- method deductive. [ABSTRACT FROM AUTHOR]

Introduction: Inconsistency in the time trade-off (TTO) task in EQ-5D-5L occurs when a respondent gives a higher value to a logically worse health state, the occurrence of inconsistency compromises the quality of the data. It is not yet clear which factors are associated with individual level inconsistency. Relating inconsistency to the characteristics of the respondent, interviewer, and the interview process could be helpful in understanding the causes of inconsistency. The objective of this paper is to discover the factors associated with individual level inconsistencies. Methods: Twenty interviewers interviewed 1,296 respondents and each respondent valued 10 health states using the EQ-VT platform in 5 cities in China. At the respondent level, inconsistency was identified in terms of severity and quantity and related to the respondent’s background characteristics, the time and iterations spent on the wheelchair example task, and the formal TTO tasks, using multilevel multinomial regression analyses. Interviewers’ impact on inconsistencies was analyzed using single level multinomial regression analyses. Results: In the full dataset, slight inconsistency was more related to the interview process (Time spent on TTO task: RRR = 1.246 with 95%CI: 1.076,1.441; time spent on Wheelchair example: RRR = 0.815 with 95%CI:0.699,0.952) while severe inconsistency was more related to respondent’s gender (Gender: RRR = 2.347 with 95%CI:1.429,3.855). One Interviewer (Interviewer 7: RRR = 7.335 with 95%CI:1.908,28.195) and interviewer’s experience (Sequence: RRR = 0.511 with 95%CI:0.385,0.678) in general showed strong influence over inconsistency in the TTO task. Conclusion: In conclusion, logical inconsistency in the valuation of EQ-5D-5L health states is associated not only with respondents’ characteristics but also with interviewers’ performance and the interview process. The role of interviewers and the importance of interviewer training may be more crucial than hitherto believed. This finding could be generalizable to other interviewer-administered health-state valuation study. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, the bases of a semimodule over a commutative semiring R are investigated. Some properties and characterizations of the bases are discussed and some equivalent conditions for a basis to be a free basis in a finitely generated free semimodule over R are given. The different possible cardinalities for a basis in a finitely generated free semimodule over R are considered and some equivalent descriptions are obtained for a commutative semiring R satisfying the property that any two bases for a finitely generated free R-semimodule have the same cardinality. Partial results obtained in the paper develop and generalize the corresponding results for commutative join-semirings and for commutative zerosumfree semirings. [Copyright &y& Elsevier]

Abstract: Let be a family of subsets of an -element set. Sperner’s theorem says that if there is no inclusion among the members of then the largest family under this condition is the one containing all -element subsets. The present paper surveys certain generalizations of this theorem. The maximum size of is to be found under the condition that a certain configuration is excluded. The configuration here is always described by inclusions. More formally, let be a poset. The maximum size of a family which does not contain as a (not-necessarily induced) subposet is denoted by . The paper is based on a lecture of the author at the Jubilee Conference on Discrete Mathematics [Banasthali University, January 11–13, 2009], but it was somewhat updated in December 2010. [Copyright &y& Elsevier]

Dempster-Shafer evidence theory has been extensively used in many information fusion systems since it was proposed by Dempster and extended by Shafer. Many scholars have been conducted on conflict management of Dempster-Shafer evidence theory in past decades. However, how to determine a potent parameter to measure evidence conflict, when the given environment is in an open world, namely the frame of discernment is incomplete, is still an open issue. In this paper, a new method which combines generalized conflict coefficient, generalized evidence distance, and generalized interval correlation coefficient based on ordered weighted averaging (OWA) operator, to measure the conflict of evidence is presented. Through ordered weighted average of these three parameters, the combinatorial coefficient can still measure the conflict effectively when one or two parameters are not valid. Several numerical examples demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we generalize the main results of Guo and Isaacs, Archiv der Mathematik 105 (2015) 215-222. We also obtain some criteria for -nilpotency of a finite group. [ABSTRACT FROM AUTHOR]

The claim that Ward’s linkage algorithm in hierarchical clustering is limited to use with Euclidean distances is investigated. In this paper, Ward’s clustering algorithm is generalised to use with l1 norm or Manhattan distances. We argue that the generalisation of Ward’s linkage method to incorporate Manhattan distances is theoretically sound and provide an example of where this method outperforms the method using Euclidean distances. As an application, we perform statistical analyses on languages using methods normally applied to biology and genetic classification. We aim to quantify differences in character traits between languages and use a statistical language signature based on relative bi-gram (sequence of two letters) frequencies to calculate a distance matrix between 32 Indo-European languages. We then use Ward’s method of hierarchical clustering to classify the languages, using the Euclidean distance and the Manhattan distance. Results obtained from using the different distance metrics are compared to show that the Ward’s algorithm characteristic of minimising intra-cluster variation and maximising inter-cluster variation is not violated when using the Manhattan metric. [ABSTRACT FROM AUTHOR]