Search

Scientific papers, as pivotal tools for academic communication, should be articulated with clarity and precision to ensure the effective conveyance of scholarly ideas and to prevent reader confusion. Yet, many such papers conspicuously lack in-depth research, and their core content is often ambiguously presented. This pattern poses a significant impediment to the progressive evolution of science and technology. While numerous researchers have recognized this widespread challenge, a holistic theoretical or methodological solution remains elusive in the academic realm. To bridge this gap, we introduce the INTEGrity vERification (INTEGER) task. This task aids researchers in assessing the integrity of their papers by verifying the clarity of each knowledge unit. To implement this task on text, we propose a multi-task learning model that utilizes the Tucker decomposition and span-level attention mechanism to identify terms and their integrity precisely. More specifically, to provide insights into the INTEGER task and validate the effectiveness of the proposed model, we collect 8076 sentences and construct three new datasets containing various types of terms and descriptions in different domains. Extensive experimental results show that our proposed model has an average performance improvement of 1.1% F1 over the three datasets compared to a series of state-of-the-art baseline methods. [ABSTRACT FROM AUTHOR]

1 student-> 1/4 Each group gets 1 pancake 1 group-> 1 72 pancake 1 pancake for 4 students 1/4+1/4+1/4+1/4+1/4+1/4 = 6/4 =11/2 * x x x 1 pancake xxx*2 <1 1/2 1; <1 1/2 DURING (Working On it) • 20 minutes-4 ~ Pancakes j { pancakes) ! Pancakes Students Student 112 Class 2: 6 pancakes for 24 8 32 8/32 3456789 students-> (6/24)/(6/6) = 1/4 4 16 4/16 4 \ 8 12 16 20 24 28 32 36 Class 3: 10 pancakes 30 Each student gets 1/4 of one They ali get 1/4 of a pancake each because students-> (10/30) / (10/10) = 2 8 2/8 pancake. - divide 1 pancake into 5 pieces (for 5 children), so each child gets 1/5 of 1 pancake, so for 4 pancakes, one child gets 1/5 of l pancake x 4 pancakes or 4/5 pancake Solution 1 Solution 2 \ 6/4 =1 1/2 ~ Solution 2» te,\,/rr~ /r]EN /R-* 1/5 four times Class 1 Class 2 / Class 3 [ xx Hxx 1(xx)(xx) # 4/5 of 1 pancake 8 pancakes B groups 6 pancakes 4 groups. [Extracted from the article]

This article is a follow-up contribution that extends the conference paper (Nxumalo, in: Laarman, Sokolova (eds)Model Checking Software - 27th International Symposium, 2021) which presented the spotlight abstraction method to enable an efficient model checking of schedulability properties of real-time operating systems. Our approach is based on iterative spotlight abstraction whereby the real-time task queue is divided into a so-called spotlight and a shade. Initially, an abstract state space model is generated from the spotlight, which contains a small number of tasks that appear at the front of the queue and the shade contains the remaining tasks. The schedulability of the spotlight tasks is model checked, whereas the behavior of the shade is summarized, and the result is saved for later re-use. If this result is still inconclusive, more tasks are iteratively brought from the shade into the spotlight, with which the model checker can proceed. These steps are repeated until a decisive schedulability result is obtained. In this article, we enrich the encoding of real-time systems into timed automata by separating operations over clock variables from operations based on other variables such as Boolean and integers. We enforce to maintain a reasonable size of the spotlight model by applying counter abstraction to the tasks that were previously confirmed schedulable in the previous iterations. We compare our approach against Timestool and RTLib, an Uppaal template, in the analysis of the schedulability of real-time tasks for the First-In-First-Out and Shortest-Deadline-First scheduling policies. Empirical results show that our approach can handle more tasks than Timestool and RTLib. [ABSTRACT FROM AUTHOR]

This paper is a corrigendum to the article "On the ideal theorem for number fields". The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term. [ABSTRACT FROM AUTHOR]

Nowadays, researchers are very interested in studying various Diophantine equations due to their importance in Cryptography, Chemistry, Knot Theory, Astronomy, Geometry, Trigonometry, Biology, Algebra, Electrical Engineering, Economics, and Astrology. The present paper is about the non-negative integer solution of the exponential Diophantine equation nx + 43y = z², where are non-negative integers, is a positive integer with nx + 43y = z², where n = 2 (mod 129) and n + 1 and is not a perfect square. The authors use the famous Catalan conjecture for this purpose. Results of the present paper indicate that 2, 3, 0, and 3 are the only required values of and respectively, that satisfy the exponential Diophantine equation, where are non-negative integers, is a positive integer with nx + 43y = z², where n = 2 (mod 129) and n + 1 and is not a perfect square. The present technique of this paper proposes a new approach to solving the Diophantine equations, which is the main scientific contribution of this study, and it is very beneficial, especially for researchers, scholars, academicians, and people interested in the same field. [ABSTRACT FROM AUTHOR]

We show that the results of the paper mentioned in the title are known or follow from the known results. [ABSTRACT FROM AUTHOR]

Integer variables are among the neo-logistic programming issues that most frequently pertain to system reliability improvement. If 'k' out of 'n' elements are present in each technology, then the configuration can be employed with 'k' out of 'n' systems. Only particular objective function structures and restrictions may be used in a heuristic technique to precisely address a dependability optimization problem. As more constraints are placed on it, the more useful it becomes; it is worthless for boosting dependability in a large system. This paper analyzes existing research on integrated reliability models with redundancy and explores system reliability optimization before proposing new recommendations. [ABSTRACT FROM AUTHOR]

Having recently come across a 1970 paper of R. L. Graham about cube-numbering and its generalizations, we found that one proof uses an inequality about the summatory function of the sum of binary digits of integers. Graham gave a very elegant and somehow unexpected proof of this inequality. We propose a more "pedestrian" --and somehow more standard-- proof of this inequality, as well as questions about possible generalizations. [ABSTRACT FROM AUTHOR]

RESEARCH SUMMARY- EQUIVALENCE FOR FRACTIONS, DECIMALS, AND PERCENTS Randall (2005) identifies a big idea for equivalence: "Every fraction/ratio can be represented by an infinite number of different but equivalent fractions/ratios" and "Decimal numbers can be named in an infinite number of different but equivalent forms" (p. 14). Fraction/Percent Strip 1 1 .44 Highlight 6/8 on the fraction/percent strip and 3/4 on the strip. lili 1 1 lili 11 1 1 - Compare the lengths for equivalence. Equivalent Fractions, Decimals, and Percents According to Fosnot and Dolk (2002), decimals and percents are really just specific equivalents of fractional relations. [Extracted from the article]

The article provide a range of conceptual approaches to the development of fraction-based understanding including paper folding, the use of number lines and using multiple fraction representations to build a foundation of success in mathematics. Topics include earliest experiences students have when learning fractions are hands-on activities involving paper folding and the coloring of 2D shapes; and useful to work with the length model first and then transition students to the number line.

This paper presents a modified version of Leibman's group-theoretic generalizations of the difference calculus for polynomial maps from nonempty commutative semigroups to groups, and proves that it has many desirable formal properties when the target group is locally nilpotent and also when the semigroup is the set of nonnegative integers. We will apply it to solve Waring's problem for general discrete Heisenberg groups in a sequel to this paper. [ABSTRACT FROM AUTHOR]

The aim of this paper is to introduce and study the concept of a hyperideal-based zero-divisor graph associated with a general hyperring. This is a generalized version of the zero-divisor graph associated with a commutative ring. For any general hyperring R having a hyperideal I, the I-based zero-divisor graph Γ(I)(R) associated with R is the simple graph whose vertices are the elements of R∖I having their hyperproduct in I, and two distinct vertices are joined by an edge when their hyperproduct has a non-empty intersection with I. In the first part of the paper, we concentrate on some general properties of this graph related to absorbing elements, while the second part is dedicated to the study of the I-based zero-divisor graph associated to the general hyperring Zn of the integers modulo n, when n=2pmq, with p and q two different odd primes, and fixing the hyperideal I. [ABSTRACT FROM AUTHOR]

The first part of this work provides explicit solutions for two integral equations; both are solved by means of Fourier transform. In the second part of this paper, sufficient conditions for the existence and uniqueness of the solutions satisfying sandwich constraints for two types of full moment problems are provided. The only given data are the moments of all positive integer orders of the solution and two other linear, not necessarily positive, constraints on it. Under natural assumptions, all the linear solutions are continuous. With their value in the subspace of polynomials being given by the moment conditions, the uniqueness follows. When the involved linear solutions and constraints are positive, the sufficient conditions mentioned above are also necessary. This is achieved in the third part of the paper. All these conditions are written in terms of quadratic expressions. [ABSTRACT FROM AUTHOR]

We shall give an elementary proof for Lemma 2.4 and correct some errors in Table 1 of the author's paper of the title. Moreover, we shall extend this table up to integers below 232. [ABSTRACT FROM AUTHOR]

This paper studies binary reverse multi-delimiter (RMD) data compression codes. RMD codes have a range of useful properties, such as unique decodability, completeness, universality, synchronizability, recognition using a finite automaton, and the ability for rapid data retrieval within an encoded file. The authors have constructed a simple monotonic mapping from the set of non-negative integers to the codeword set. Based on this mapping, they have developed a fast byte-aligned decoding algorithm. Computer experiments demonstrate that we can decode RMD codes nearly as quickly as the SCDC code and several times faster than the Fibonacci code. Compared to known codes of a similar type, RMD codes exhibit a better compression ratio for natural language texts (more than four times closer to the entropy bound than SCDC). Additionally, the paper describes a technology for preprocessing natural language texts, which, combined with encoding using RMD codes, enhances the efficiency of powerful modern archivers. [ABSTRACT FROM AUTHOR]

Let p ≥ 2 be a prime number and let a, b,m be positive integers such that p - m. In a recent paper [1], we discussed the maximal prime power pe, which divides the numerator of the fraction ... when written in reduced form. This short note may be regarded as an addendum to paper [1] for the case where p = 2, b = 1, m > 1 and 2a∥m - 1, which was left open. [ABSTRACT FROM AUTHOR]

The present paper considers a discrete analog of the parking problem. Let n be an integer. If n > 1, then we randomly locate an interval (t, t + 1) with integer endpoints on a segment [0, n]. Thus, the original segment is divided into two: [0, t] and [t + 1, n], and each of them is further considered separately likewise the original one. The phrase "randomly" in this problem means that t is a uniformly distributed on a set {1,... , n − 1} random variable. The process of location of the intervals finishes when the lengths of all the remaining intervals are less than 2. Define as Xn the total amount of the located intervals. In the present paper, the expectations {Xn} are calculated. The process described above can be interpreted as a parking process of cars with handlebars on the left. Hence, the driver is able to leave his car only if the place on his left is free. This is exactly the case when the driver cannot take the left end place of any free segment. In this case, Xn stands for the amount of the parked cars. [ABSTRACT FROM AUTHOR]

In this paper, we prove that the Diophantine equation 147x + 741y = z² has no non-negative integer solution. [ABSTRACT FROM AUTHOR]

Our goal of this paper is to find a construction of all ℓ-quasi-cyclic self-dual codes over a finite field $ {\mathbb F}_q $ F q of length $ m\ell $ mℓ for every positive even integer ℓ. In this paper, we study the case where $ x^m-1 $ x m − 1 has an arbitrary number of irreducible factors in $ {\mathbb F}_q [x] $ F q [ x ] ; in the previous studies, only some special cases where $ x^m-1 $ x m − 1 has exactly two or three irreducible factors in $ {\mathbb F}_q [x] $ F q [ x ] , were studied. Firstly, the binary code case is completed: for any even positive integer ℓ, every binary ℓ-quasi-cyclic self-dual code can be obtained by our construction. Secondly, we work on the q-ary code cases for an odd prime power q. We find an explicit method for construction of all ℓ-quasi-cyclic self-dual codes over $ {\mathbb F}_q $ F q of length $ m\ell $ mℓ for any even positive integer ℓ, where we require that $ q \equiv 1 \pmod {4} $ q ≡ 1 (mod 4) if the index $ \ell \ge 6 $ ℓ ≥ 6. By implementation of our method, we obtain a new optimal binary self-dual code $ [172, 86, 24] $ [ 172 , 86 , 24 ] , which is also a quasi-cyclic code of index 4. [ABSTRACT FROM AUTHOR]

This paper addresses the uniqueness problem concerning the j-th derivative of a meromorphic function f(z) and the k-th derivative of its shift, f(z + c), where j, k are integers with 0 ≤ j < k. In this regard, our work surpasses the achievements of [2], as we have improved upon the existing results and provided a more refined understanding of this specific aspect. We give some illustrative examples to enhance the realism of the obtained outcomes. Denote by E(a, f) the set of all zeros of f-a, where each zero with multiplicity m is counted m times. In the paper proved, in particular, the following statement: Let f(z) be a non-constant meromorphic function of finite order, c be a non-zero finite complex number and j, k be integers such that 0 ≤ j < k. If f(j)(z) and f(k)(z + c) have the same a-points for a finite value a(̸= 0) and satisfy conditions... [ABSTRACT FROM AUTHOR]

In 2019, Burshtein [1] showed that the equation px+py = z² has no positive integer solution, except for p = 2, 3. For p = 2, all solutions of the equation in the Fibonacci and Lucas numbers was investigated by Hashim [2]. In this paper, we prove that (x, y, z) = (F5,L3,L6) is the unique solution of the equation, when p = 3. [ABSTRACT FROM AUTHOR]

We study the square root computation by Leonardo Fibonacci (or Leonardo of Pisa) in his MSS Liber Abaci from c1202 and c1228 and De Practica Geometrie from c1220. In this MSS, Fibonacci systematically describes finding the integer part of the square root of an integer in numerous examples with three to seven decimal digits. The results of these examples are summarized in a table in the paper. Liber Abaci also describes in detail finding an approximation to the fractional part of the square root. However, in other examples in Liber Abaci and De Practica Geometrie, only the approximate values of the fractional part of the square roots are stated. This paper further explores these approximate values using techniques like reverse engineering. Contrary to many claims that Fibonacci also used other methods or approximations, we show that all examples can be explained using one digit-by-digit method to compute the integer part of the square root and one approximation scheme for the fractional part. Further, it is shown that the approximation scheme is tied to the method to compute the integer part of the square root. [ABSTRACT FROM AUTHOR]

Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type max { c ⊤ x : A x = b , x ∈ Z ≥ 0 n } , where all the entries of A, b, c are integer, parameterized by the number of rows of A and ‖ A ‖ max . This class of problems is known under the name of ILP problems in the standard form, adding the word "bounded" if x ≤ u , for some integer vector u. Recently, many new sparsity, proximity, and complexity results were obtained for bounded and unbounded ILP problems in the standard form. In this paper, we consider ILP problems in the canonical form max { c ⊤ x : b l ≤ A x ≤ b r , x ∈ Z n } , where b l and b r are integer vectors. We assume that the integer matrix A has the rank n, (n + m) rows, n columns, and parameterize the problem by m and Δ (A) , where Δ (A) is the maximum of n × n sub-determinants of A, taken in the absolute value. We show that any ILP problem in the standard form can be polynomially reduced to some ILP problem in the canonical form, preserving m and Δ (A) , but the reverse reduction is not always possible. More precisely, we define the class of generalized ILP problems in the standard form, which includes an additional group constraint, and prove the equivalence to ILP problems in the canonical form. We generalize known sparsity, proximity, and complexity bounds for ILP problems in the canonical form. Additionally, sometimes, we strengthen previously known results for ILP problems in the canonical form, and, sometimes, we give shorter proofs. Finally, we consider the special cases of m ∈ { 0 , 1 } . By this way, we give specialised sparsity, proximity, and complexity bounds for the problems on simplices, Knapsack problems and Subset-Sum problems. [ABSTRACT FROM AUTHOR]

Let O K = Z [ i ] . For each positive integer n , denote ξ K (n) as the number of integral ideals whose norm divides n in O K . In this paper, we studied the distribution of ideals whose norm divides n in O K by using the Selberg-Delange method. This is a natural variant of a result studied by Deshouillers, Dress, and Tenenbaum (often called the DDT Theorem), and we found that the distribution function was subject to beta distribution with density 3 / (2 π u 2 (1 − u) 3) . Let . For each positive integer , denote as the number of integral ideals whose norm divides in . In this paper, we studied the distribution of ideals whose norm divides in by using the Selberg-Delange method. This is a natural variant of a result studied by Deshouillers, Dress, and Tenenbaum (often called the DDT Theorem), and we found that the distribution function was subject to beta distribution with density . [ABSTRACT FROM AUTHOR]

Let n be an integer greater than 1 . In this paper, we obtained the stability of the multivariable Cauchy-Jensen functional equation n f (x 1 + ⋯ + x n , y 1 + ⋯ + y n n) = ∑ 1 ≤ i , j ≤ n f (x i , y j) in Banach spaces, quasi-Banach spaces, and normed 2 -Banach spaces. Let be an integer greater than . In this paper, we obtained the stability of the multivariable Cauchy-Jensen functional equation in Banach spaces, quasi-Banach spaces, and normed -Banach spaces. [ABSTRACT FROM AUTHOR]

This paper aims to explore the arithmetic properties of Fu's k dots bracelet partition where k = pα, p is a prime number with p ≥ 5 and α is an integer with α ≥ 0. For pα dots bracelet partitions with p = 5, 7 and 11, we found several exciting Ramanujan-like congruences modulo p. We also used Newman's theorems to demonstrate certain congruence modulo p. [ABSTRACT FROM AUTHOR]

In this paper we resolve a conjecture of Kresch and Tamvakis [Duke Math. J. 110 (2001), pp. 359–376]. Our result is the following. Theorem : For any positive integer D and any integers i,j (0\leq i,j \leq D), \; the absolute value of the following hypergeometric series is at most 1: \begin{equation*} {_4F_3} \left [ \begin {array}{c} -i, \; i+1, \; -j, \; j+1 \\ 1, \; D+2, \; -D \end{array} ; 1 \right ]. \end{equation*} To prove this theorem, we use the Biedenharn-Elliott identity, the theory of Leonard pairs, and the Perron-Frobenius theorem. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of computing the entire sequence of the maximum degree of minors of a block-structured symbolic matrix (a generic partitioned polynomial matrix) A = (A α β x α β t d α β ) , where A α β is a 2 × 2 matrix over a field F , x α β is an indeterminate, and d α β is an integer for α = 1 , 2 , ⋯ , μ and β = 1 , 2 , ⋯ , ν , and t is an additional indeterminate. This problem can be viewed as an algebraic generalization of the maximum weight bipartite matching problem. The main result of this paper is a combinatorial -time algorithm for computing the entire sequence of the maximum degree of minors of a (2 × 2) -type generic partitioned polynomial matrix of size 2 μ × 2 ν . We also present a minimax theorem, which can be used as a good characterization (NP ∩ co-NP characterization) for the computation of the maximum degree of minors of order k. Our results generalize the classical primal-dual algorithm (the Hungarian method) and minimax formula (Egerváry's theorem) for the maximum weight bipartite matching problem. [ABSTRACT FROM AUTHOR]

This paper is a sequel to [Monatsh. Math.194 (2021) 523–554] in which results of that paper are generalized so that they hold in the setting of inhomogeneous Diophantine approximation. Given any integers n ≥ 2 and ℓ ≥ 1 , any ξ = (ξ 1 , ... , ξ ℓ) ∈ ℝ ℓ , and any homogeneous function f = (f 1 , ... , f ℓ) : ℝ n → ℝ ℓ that satisfies a certain nonsingularity assumption, we obtain a biconditional criterion on the approximating function ψ = (ψ 1 , ... , ψ ℓ) : ℝ ≥ 0 → (ℝ > 0) ℓ for a generic element f ∘ g in the SL n (ℝ) -orbit of f to be (respectively, not to be) ψ -approximable at ξ = (ξ 1 , ... , ξ n) : that is, for there to exist infinitely many (respectively, only finitely many) v ∈ ℤ n such that | ξ j − (f j ∘ g) (v) | ≤ ψ j (∥ v ∥) for each j ∈ { 1 , ... , ℓ }. In this setting, we also obtain a sufficient condition for uniform approximation. We also consider some examples of f that do not satisfy our nonsingularity assumptions and prove similar results for these examples. Moreover, one can replace SL n (ℝ) above by any closed subgroup of ASL n (ℝ) that satisfies certain integrability axioms (being of Siegel and Rogers type) introduced by the authors in the aforementioned previous paper. [ABSTRACT FROM AUTHOR]

The singleton defect of an [n, k, d] linear code C is defined as s (C) = n - k + 1 - d . Codes with s (C) = s (C ⊥) = 1 are called near maximum distance separable (NMDS) codes. It is known that an [ n , 3 , n - 3 ] NMDS code is equivalent to an (n, 3)-arc in PG(2, q). In this paper, by adding some suitable projective points into some known (q + 5 , 3) -arcs in PG(2, q), we obtain two families of [ q + 7 , 3 , q + 4 ] NMDS codes for even prime power q and a family of [ q + 6 , 3 , q + 3 ] NMDS codes for odd prime power q. In addition, when q = 2 m and m is odd, by adding m suitable projective points into the maximum arcs in PG(2, q), we obtain a family of [ q + m + 2 , 3 , q + m - 1 ] NMDS codes over F q , from which we further induce a family of NMDS codes with parameters [ q t + m + 2 , 3 , q t + m - 1 ] over the extension field F q t for any odd integer t. All the resulting NMDS codes in this paper are shown to be linearly inequivalent to the NMDS codes constructed from elliptic curves, and their weight distributions are completely determined. [ABSTRACT FROM AUTHOR]

Let R be a ring and let n ≥ 1 be a fixed integer. An additive mapping h of a ring R into itself is called an n-Jordan homoderivation if h ⁢ (x n) = (h ⁢ (x) + x) n - x n holds for all x ∈ R . In this paper, we initiate the study of n-Jordan homoderivations on rings. Precisely, we characterize n-Jordan homoderivations in terms of homoderivations and anti-homomorphisms under certain conditions. Finally, we conclude our paper with a direction for further research. [ABSTRACT FROM AUTHOR]

Let Fq be the finite field of order q where q = pk, k is a positive integer and p is an odd prime. Let F*q represent the nonzero elements of Fq. For f(x1,···,xn) ∊ Fq[x1,···,xn], we used N(f(x1,···,xn) = 0) to denote the number of Fq-rational points of the affine hypersurface f(x1,···,xn) = 0. In 2020, Zhao et al. obtained the explicit formulae for N(x41 + x42 = c), N(x41 + x42+ x43 = c) and N(41+ x42+ x43+ x44 = c) over Fq, with c ∊ F*q. In this paper, by using Jacobi sums and an analog of the Hasse-Davenport theorem, we arrived at explicit formulae for N(a1x41 + a2x42 = c) and N(b1x41 + b2x42 + b3x43 = c) with ai, bj ∊ F*q(1 ≤ i ≤ 2, 1 ≤ j ≤ 3) and c ∊ Fq. Furthermore, by using the reduction formula for Jacobi sums, the number of rational points of the quartic diagonal hypersurface a1x41 + a2x42 +···+ anx4n = c of n ≥ 4 variables with ai ∊ F*q (1 ≤ i ≤ n), c ∊ Fq and p = 1(mod 4), can also be deduced. These extended and improved earlier results. [ABSTRACT FROM AUTHOR]

In this paper, we show that the cover ideals of Jahangir's graphs are normal, and also satisfy the (symbolic) (strong) persistence property. In addition, we determine when the unique homogeneous maximal ideal appears in the set of associated primes of powers of the cover ideals of Jahangir's graphs. [ABSTRACT FROM AUTHOR]

In 2012, Ponraj et al. defined k-product cordial labeling as follows: Let f be a map from V (G) to { 0 , 1 , ... , k − 1 } where k is an integer, 1 ≤ k ≤ | V (G) |. For each edge u v assign the label f (u) f (v) (mod  k). f is called a k-product cordial labeling if | v f (i) − v f (j) | ≤ 1 , and | e f (i) − e f (j) | ≤ 1 , i , j ∈ { 0 , 1 , ... , k − 1 } , where v f (x) and e f (x) denote the number of vertices and edges, respectively, labeled with x (x = 0 , 1 , ... , k − 1). A graph that admits k-product cordial labeling is called k-product cordial graph. Later, we proved that several families of graphs are k-product cordial graphs. In this paper, we show that the product of graphs admit k-product cordial labeling. [ABSTRACT FROM AUTHOR]

Let p and q be two different prime integers such that p Ξ q Ξ 3 (mod 8) with (p/q) = 1, and l a positive odd square-free integer relatively prime to p and q. In this paper we investigate the unit groups of number fields L = Q(√2, √p, √q, √-1). [ABSTRACT FROM AUTHOR]

For an integer k ≥ 2 , let (P n (k)) n be the k-generalized Pell sequence which starts with 0 , ... , 0 , 1 (k terms), and each term afterwards is given by P n (k) = 2 P n − 1 (k) + P n − 2 (k) + ⋯ + P n − k (k) . In this paper, we determine all solutions of the Markov equation x 2 + y 2 + z 2 = 3 x y z , with x, y, and z being k-generalized Pell numbers. This paper continues and extends a previous work of Kafle, Srinivasan and Togbé, who found all Markov triples with Pell components. [ABSTRACT FROM AUTHOR]

Let K3 be a non-normal cubic extension over Q. In this paper, we investigate the higher moments of coefficients aK3 (n) of the Dedekind zeta function of the following type Σ(n≤x) al K3 (n), where l ≥ 4 is any fixed positive integer. [ABSTRACT FROM AUTHOR]

According to Dastanpour and Ghorbani, a ring R is said to satisfy divisibility on ascending chains of right ideals (ACCd) if, for every ascending chain of right ideals I1 ⊆ I2 ⊆ I3 ⊆ I4 ⊆ ... of R, there exists an integer k ∈ N such that for each i ≥ k, there exists an element ai ∈ R such that Ii = aiIi+1. In this paper, we examine the transfer of the ACCd-condition on ideals to trivial ring extensions. Moreover, we investigate the connection between the ACCd on ideals and other ascending chain conditions. For example we will prove that if R is a ring with ACCd on ideals, then R has ACC on prime ideals. [ABSTRACT FROM AUTHOR]

Congruences mod p for a prime p and partial products of the numbers 1,..., p − 1 are obtained. Bibliography: 2 titles. [ABSTRACT FROM AUTHOR]

Traditional single image super-resolution (SISR) methods, which focus on integer scale super-resolution, often require separate training for each scale factor, leading to increased computational resource consumption. In this paper, we propose MambaSR, a novel arbitrary-scale super-resolution approach integrating Mamba with Fast Fourier Convolution Blocks. MambaSR leverages the strengths of the Mamba state-space model to extract long-range dependencies. In addition, Fast Fourier Convolution Blocks are proposed to capture the global information in the frequency domain. The experimental results demonstrate that MambaSR achieves superior performance compared to different methods across various benchmark datasets. Specifically, on the Urban100 dataset, MambaSR outperforms MetaSR by 0.93 dB in PSNR and 0.0203 dB in SSIM, and on the Manga109 dataset, it achieves an average PSNR improvement of 1.00 dB and an SSIM improvement of 0.0093 dB. These results highlight the efficacy of MambaSR in enhancing image quality for arbitrary-scale super-resolution. [ABSTRACT FROM AUTHOR]

This paper introduced a novel semiring structure involving nonnegative integers, where operations depended on the comparison of the magnitudes of decimal digit sums. Consequently, a corresponding matrix semiring can be established on this commutative semiring. We showed that the 3-satisfiability problem can be polynomial-time reduced to solving systems of quadratic polynomial equations over this semiring. We proposed a key exchange protocol based on this matrix semiring, with its security relying on the two-sided digital circulant matrix action problem over this semiring. This scheme provides a novel cryptographic primitive for post-quantum cryptography. [ABSTRACT FROM AUTHOR]

The fixed-length Levenshtein (FLL) distance between two words x , y ∈ Z m n is the smallest integer t such that x can be transformed to y by t insertions and t deletions. The size of a ball in the FLL metric is a fundamental yet challenging problem. Very recently, Bar-Lev, Etzion, and Yaakobi explicitly determined the minimum, maximum and average sizes of the FLL balls with radius one, respectively. In this paper, based on these results, we further prove that the size of the FLL balls with radius one is highly concentrated around its mean by Azuma's inequality. [ABSTRACT FROM AUTHOR]

For nonnegative integers h , g with h ≥ 2 , a set A of nonnegative integers is defined as a B h [ g ] sequence if, for every nonnegative integer n , the number of representations of n with the form n = a 1 + a 2 + ⋯ + a h is no larger than g , where a 1 ≤ ⋯ ≤ a h and a i ∈ A for i = 1 , 2 , ⋯ , h. Let Z be the set of integers and N be the set of positive integers. In 2013, by introducing the method of Inserting Zeros Transformation , Cilleruelo and Nathanson obtained the following result: let f : Z → N ⋃ { 0 , ∞ } be any function such that lim inf | n | → ∞ f (n) ≥ g and let B be any B h [ g ] sequence. Then, for any decreasing function ϵ (x) → 0 as x → ∞ , there exists a sequence A of integers such that r A , h (n) = f (n) for all n ∈ Z and A (x) ≫ B (x ϵ (x)). Recently, Nathanson further considered Sidon sets for linear forms. In this paper, we apply the Inserting Zeros Transformation into Sidon sets for linear forms and generalize the above result related to the inverse problem of representation functions. For a video summary of this paper, please visit https://youtu.be/KRtew2rLbXY. [ABSTRACT FROM AUTHOR]

Let { X n } n ∈ Z be a stationary process with values in a finite set. In this paper, we present a moving average version of the Shannon–McMillan–Breiman theorem; this generalize the corresponding classical results. A sandwich argument reduced the proof to direct applications of the moving strong law of large numbers. The result generalizes the work by Algoet et. al., while relying on a similar sandwich method. It is worth noting that, in some kind of significance, the indices a n and ϕ (n) are symmetrical, i.e., for any integer n, if the growth rate of (a n) n ∈ Z is slow enough, all conclusions in this article still hold true. [ABSTRACT FROM AUTHOR]

A set S ⊆ V is referred to as a k-fault-tolerant power-dominating set of a given graph G = (V , E) if the difference S ∖ F remains a power-dominating set of G for any F ⊆ S with | F | ≤ k , where k is an integer with 0 ≤ k < | V | . The lowest cardinality of a k-fault-tolerant power-dominating set is the k-fault-tolerant power-domination number of G, denoted by γ P k (G) . Generalized Petersen graphs G P (m , k) and generalized cylinders S G are two well-known graph classes. In this paper, we calculate the k-fault-tolerant power-domination number of the generalized Petersen graphs G P (m , 1) and G P (m , 2) . Also, we obtain γ P k (G) for the subclasses of cylinders S C m and S B m . [ABSTRACT FROM AUTHOR]