Search

This paper refers to Langlands' big set of notes devoted to the question if the (normalized) local Hecke–Tate root number Δ=Δ(E,χ)$\Delta =\Delta (E,\chi)$, where E is a finite separable extension of a fixed nonarchimedean local field F, and χ a quasicharacter of E×$E^\times$, can be appropriately extended to a local ε‐factor εΔ=εΔ(E,ρ)$\varepsilon _\Delta =\varepsilon _\Delta (E,\rho)$ for all virtual representations ρ of the corresponding Weil group WE$W_E$. Whereas Deligne has given a relatively short proof by using the global Artin–Weil L‐functions, the proof of Langlands is purely local and splits into two parts: the algebraic part to find a minimal set of relations for the functions Δ, such that the existence (and unicity) of εΔ$\varepsilon _\Delta$ will follow from these relations; and the more extensive arithmetic part to give a direct proof that all these relations are actually fulfilled. Our aim is to cover the algebraic part of Langlands' notes, which can be done completely in the framework of representations of solvable profinite groups, where two modifications of Brauer's theorem play a prominent role. [ABSTRACT FROM AUTHOR]

Abstract Basic numerical skills provide an important foundation for the learning of mathematics. Thus, it is critical that researchers and educators have access to valid and reliable ways of assessing young children's numerical skills. The purpose of this study was to evaluate the concurrent, predictive, and incremental validity of a two-minute paper-and-pencil measure of children's symbolic (Arabic numerals) and non-symbolic (dot arrays) comparison skills. A sample of kindergarten children (M age = 5.86, N = 439) were assessed on the measure along with a number line estimation task, a measure of arithmetic, and several control measures. Results indicated that performance on the symbolic comparison task explained unique variance in children's arithmetic performance in kindergarten. Longitudinal analyses demonstrated that both symbolic comparison and number line estimation in kindergarten were independent predictors of 1st grade mathematics achievement. However, only symbolic comparison remained a unique predictor once language skills and processing speed were taken into account. These results suggest that a two-minute paper-and-pencil measure of children's symbolic number comparison is a reliable predictor of children's early mathematics performance. Highlights • We tested the validity and reliability of a recently developed Numeracy Screener. • Performance on the symbolic comparison task predicted kindergarten children's arithmetic performance. • Performance on the symbolic comparison task in kindergarten predicted school mathematics achievement one year later. • The Numeracy Screener may be a useful tool for early mathematics researchers and educators alike. [ABSTRACT FROM AUTHOR]

Let G be a classical group defined over a local field F of characteristic zero. For any irreducible admissible representation \pi of G(F), which is of Casselman-Wallach type if F is archimedean, we extend the study of spectral decomposition of local descents by Jiang and Zhang [Algebra Number Theory 12 (2018), 1489–1535] for special orthogonal groups over non-archimedean local fields to more general classical groups over any local field F. In particular, if \pi has a generic local L-parameter, we introduce the spectral first occurrence index {\mathfrak {f}}_{\mathfrak {s}}(\pi) and the arithmetic first occurrence index {\mathfrak {f}}_{{\mathfrak {a}}}(\pi) of \pi and prove in this paper that {\mathfrak {f}}_{\mathfrak {s}}(\pi)={\mathfrak {f}}_{{\mathfrak {a}}}(\pi). Based on the theory of consecutive descents of enhanced L-parameters developed by Jiang, Liu, and Zhang [Arithmetic wavefront sets and generic L-packets, arXiv:2207.04700], we are able to show in this paper that the first descent spectrum consists of all discrete series representations, which determines explicitly the branching decomposition problem by means of the relevant arithmetic data and extends the main result (Jiang and Zhang [Algebra Number Theory 12 (2018), 1489–1535], Theorem 1.7) to broader generality. [ABSTRACT FROM AUTHOR]

The primary purpose of this paper is to generalize the classical Riemann zeta function to the setting of Krull monoids with torsion class groups. We provide a first study of the same generalization by extending Euler's classical product formula to the more general scenario of Krull monoids with torsion class groups. In doing so, the Decay Theorem is fundamental as it allows us to use strong atoms instead of primes to obtain a weaker version of the Fundamental Theorem of Arithmetic in the more general setting of Krull monoids with torsion class groups. Several related examples are exhibited throughout the paper, in particular, algebraic number fields for which the generalized Riemann zeta function specializes to the Dedekind zeta function. [ABSTRACT FROM AUTHOR]

Very recently, Pushpa and Vasuki (Arab. J. Math. 11, 355–378, 2022) have proved Eisenstein series identities of level 5 of weight 2 due to Ramanujan and some new Eisenstein identities for level 7 by the elementary way. In their paper, they introduced seven restricted color partition functions, namely P ∗ (n) , M (n) , T ∗ (n) , L (n) , K (n) , A (n) , and B(n), and proved a few congruence properties of these functions. The main aim of this paper is to obtain several new infinite families of congruences modulo 2 a · 5 ℓ for P ∗ (n) , modulo 2 3 for M(n) and T ∗ (n) , where a = 3 , 4 and ℓ ≥ 1 . For instance, we prove that for n ≥ 0 , P ∗ (5 ℓ (4 n + 3) + 5 ℓ - 1) ≡ 0 (mod 2 3 · 5 ℓ). In addition, we prove witness identities for the following congruences due to Pushpa and Vasuki: M (5 n + 4) ≡ 0 (mod 5) , T ∗ (5 n + 3) ≡ 0 (mod 5). [ABSTRACT FROM AUTHOR]

In this paper, a stability analysis and the controller improvement of T-S fuzzy Descriptor system are studied. Firstly, by making full use of the related theory of fuzzy affiliation function and combining the design method of fuzzy Lyapunov function with the method of inequality deflation, a stability condition with wider admissibility and less system conservatism is proposed. The advantage of this method is that it is not necessary to ensure that each fuzzy subsystem is progressively stable. We also maximise the boundary of the derivatives of the affiliation function mined. Secondly, a PDC controller and a Non-PDC controller are designed, and the deflation conditions for the linear matrix inequalities of the two controllers are constructed. Finally, some arithmetic simulations and practical examples are given to demonstrate the effectiveness of the method studied in this paper, and the results obtained are less conservative and have larger feasible domains than previous methods. [ABSTRACT FROM AUTHOR]

AbstractIn a recent paper, Baker and Oliver Lorscheid showed that Descartes’s Rule of Signs and Newton’s Polygon Rule can both be interpreted as multiplicities of polynomials over hyperfields. Hyperfields are a generalization of fields which encode things like the arithmetic of signs or of absolute values. By looking at multiplicities of polynomials over such algebraic structures, Baker and Lorscheid showed that you can recover the rules of Descartes and Newton. In this paper, we define tropical extensions for idylls. Such extensions have appeared for semirings with negation symmetries in the work of Akian-Gaubert-Guterman and for hypergroups and hyperfields in the work of Bowler-Su. Examples of tropical extensions are extending the tropical hyperfield to higher ranks, or extending the hyperfield of signs to the tropical real hyperfield by including a valuation. The results of this paper concern the interaction of multiplicities and tropical extensions. First, there is a lifting theorem from initial forms to the entire polynomial from which we will show that multiplicities for a polynomial are equal to the corresponding multiplicity for some initial form. Second, we show that tropical extensions preserve the property that the sum of all multiplicities is bounded by the degree. Consequentially, we have this degree bound for every stringent hyperfield. This gives a partial answer to a question posed by Baker and Lorscheid about which hyperfields have this property. [ABSTRACT FROM AUTHOR]

A binary operation # on Z + is said to be an associative arithmetic if both # and its iteration — the binary operation ∗ defined recursively by: x∗1 = x and x∗y = [x ∗ (y −1)]#x — are associative. E. Rosinger [6] showed that under reasonable conditions an associative arithmetic must be ordinary addition. However, in the general case, there are associative arithmetics that are not ordinary addition. This paper gives examples of these as well as results towards a structure theorem for associative arithmetics. The paper also describes the role that this particular math problem has played in my mathematical life. [ABSTRACT FROM AUTHOR]

The need to complete multiple tasks concurrently is a common occurrence both daily life and in occupational activities, which can often include simultaneous cognitive and physical demands. As one example, there is increasing availability of head-worn display technologies that can be employed when a user is mobile (e.g., while walking). This new method of information presentation may, however, introduce risks of adverse outcomes such as a decrement to gait performance. The goal of this study was thus to quantify the effects of a head-worn display (i.e., smart glasses) on motor variability during gait and to compare these effects with those of other common information displays (i.e., smartphone and paper-based system). Twenty participants completed four walking conditions, as a single task and in three dual-task conditions (three information displays). In the dual-task conditions, the information display was used to present several cognitive tasks. Three different measures were used to quantify variability in gait parameters for each walking condition (using the cycle-to-cycle standard deviation, sample entropy, and the “goal-equivalent manifold” approach). Our results indicated that participants used less adaptable gait strategies in dual-task walking using the paper-based system and smartphone conditions compared with single-task walking. Gait performance, however, was less affected during dual-task walking with the smart glasses. We conclude that the risk of an adverse gait event (e.g., a fall) in head-down walking conditions (i.e., the paper-based system and smartphone conditions) were higher than in single-task walking, and that head-worn displays might help reduce the risk of such events during dual-task gait conditions. [ABSTRACT FROM AUTHOR]

In this paper we analyze the stability of the problem of performing a rational QZ step with a shift that is an eigenvalue of a given regular pencil H - λ K in unreduced Hessenberg–Hessenberg form. In exact arithmetic, the backward rational QZ step moves the eigenvalue to the top of the pencil, while the rest of the pencil is maintained in Hessenberg–Hessenberg form, which then yields a deflation of the given shift. But in finite-precision the rational QZ step gets "blurred" and precludes the deflation of the given shift at the top of the pencil. In this paper we show that when we first compute the corresponding eigenvector to sufficient accuracy, then the rational QZ step can be constructed using this eigenvector, so that the exact deflation is also obtained in finite-precision. [ABSTRACT FROM AUTHOR]

This paper is concerned with the construction of a small, but non-trivial, example of a polynomial identity algebra, which we call the Jackson algebra, that will be used in sequels to this paper to study non-commutative arithmetic geometry. In this paper this algebra is studied from a ring-theoretic and geometric viewpoint. Among other things it turns out that this algebra is a "non-commutative family" of central simple algebras and thus parameterizes Brauer classes over extensions of the base. [ABSTRACT FROM AUTHOR]

"Which graphs are determined by their spectra (DS for short)?" is an important and challenging topic in spectral graph theory. Let G be an n -vertex graph with adjacency matrix A (G) and adjacency walk matrix W A (G) = [ e , A (G) e , ... , A n − 1 (G) e ]. We call G controllable if the rank of W A (G) is n over R and noncontrollable otherwise. In Wang (2017), the author gave a simple condition for a controllable graph to be determined by their generalized adjacency spectrum (DGAS for short). However, the result fails for noncontrollable graphs. In this paper, we consider the problem in the context of the generalized distance spectrum. Let G be a connected graph with distance matrix D. A graph G is determined by its generalized distance spectrum (DG D S for short) if any graph H sharing the same generalized distance spectrum with G must be isomorphic to G. The paper aims to extend the result in Wang (2017) from generalized adjacency spectrum to generalized distance spectrum. Besides, a simple arithmetic criterion is given to determine whether a connected graph is DG D S or not, which is applicable to some kind of noncontrollable graphs, e.g., regular graphs. [ABSTRACT FROM AUTHOR]

To model fuzzy numbers with the confidence degree and better account for information uncertainty, Zadeh came up with the notion of Z-numbers, which can effectively combine the objective information of things with subjective human interpretation of perceptive information, thereby improving the human comprehension of natural language. Although many numbers are in fact Z-numbers, their higher computational complexity often prevents their recognition as such. In order to reduce computational complexity, this paper reviews the development and research direction of Z-numbers and deduces the operational rules for symmetric triangular Z-numbers. We first transform them into classical fuzzy numbers. Using linear programming, the extension principle of Zadeh, the convolution formula, and fuzzy number algorithms, we determine the operational rules for the basic operations of symmetric triangular Z-numbers, which are number-multiplication, addition, subtraction, multiplication, power, and division. Our operational rules reduce the complexity of calculation, improve computational efficiency, and effectively reduce the information difference while being applicable to other complex operations. This paper innovatively combines Z-numbers with classical fuzzy numbers in Z-number operations, and as such represents a continuation and innovation of the research on the operational laws of Z-numbers. [ABSTRACT FROM AUTHOR]

In the era of low-power very large-scale integration design, approximate computing is a soaring design paradigm that assures energy-efficient circuit design at the cost of some accuracy. Multiplication is a very important operation of an arithmetic unit and compressor is the inherent part of the multiplier. In this paper, an energy-efficient design of a 4:2 approximate compressor is proposed. The inclusion of the extra leakage control transistors in the logic has led to leakage power reduction, which ultimately reduces the power dissipation in the circuits. The proposed 4:2 compressor is simulated at 10 nm fin-field effect transistor (FinFET) technology. The proposed compressor has been verified for its functionality and robustness. The proposed design shows a power dissipation of 154.48 nW and a delay of 9.16 ps. In comparison to other 4:2 approximate compressors, the proposed compressor shows the least power dissipation, the lowest power delay product (PDP) and the highest robustness. The power dissipation of the proposed compressor is 92.84% less than that of the base compressor. The PDP of the designed compressor is 80.58% less than the minimum PDP among other compressors. The aging analysis for the negative bias temperature instability (NBTI) effect is also checked for the proposed compressor and compared with the existing designs. [ABSTRACT FROM AUTHOR]

The design of a Ternary Logic Processor using CNTFETs (Carbon-Nanotube-Field-Effect-Transistor) is a challenging task, but it also has the potential to offer significant advantages over the traditional binary logic processors based on CMOS (Complementary-Metal-Oxide-Semiconductor) technology. This paper presents the design and implementation of a Ternary Logic Processor (TLP) using CNTFETs. The TLP is a single-cycle processor that operates on three-trit data. An Instruction Set Architecture (ISA) is defined, at first, for this TLP that consists of instructions of the Register type, Load-store type, Immediate type, and branch type. Based on the ISA, the architecture of the CNTFET-based TLP is proposed and the transistor level designs of the TLPs' fundamental blocks like the Ternary Instruction Fetch (TIF), Ternary Register File (TRF), Ternary Arithmetic and Logic Unit (TALU) and Ternary Data Memory (TDM) are presented. HSPICE simulations using a standard CNTFET model, are performed for the TLP and the TLPs' individual blocks and the performance parameters like the power consumption, propagation delay, and the number of CNTFETs required are calculated. In addition to this, the functionality of the processor is verified using a few of the standard programs. [ABSTRACT FROM AUTHOR]

This paper discusses a longitudinal study with children with Apert syndrome aged between 4 and 11 years. There has long been an interest in the role of fingers in the development of early number skills and arithmetic. As children with Apert syndrome are born with complex fusions of their fingers, they have to undergo several surgical procedures in order to obtain individuated fingers. This has implications for their finger mobility and finger awareness. It has been suggested that children with Apert syndrome have specific difficulties with early number and arithmetic activities. The findings from this study suggest that engaging children with Apert syndrome in activities that develop finger awareness (finger gnosis) and finger mobility (fine motor skills) may have a positive impact on their ability to engage with appropriate mathematics curricula at school. This is relevant to all those involved in the care of children with Apert syndrome and will be of particular relevance to those involved in early childhood and primary education. This study also provides new insights into the role of finger use in the development of skills and understanding in early number and arithmetic. [ABSTRACT FROM AUTHOR]

In this paper we present a complete asymptotic expansion of the Archimedean compound of two symmetric homogeneous means and derive recursive algorithms for coefficients in this expansion. We also show some examples and obtain explicit expansions for the Archimedean compounds of the arithmetic, geometric and harmonic means. [ABSTRACT FROM AUTHOR]

For a curve in positive characteristic, the Cartier operator acts on the vector space of its regular differentials. The a-number is defined to be the dimension of the kernel of the Cartier operator. In [a-numbers of curves in Artin–Schreier covers, Algebra Number Theory 14(3) (2020) 587–641], Booher and Cais use a sheaf-theoretic approach to give bounds on the a-numbers of Artin–Schreier covers. In this paper, I generalize that approach to arbitrary powers of the Cartier operator, yielding bounds for the dimension of the kernel. These bounds give new restrictions on the Ekedahl-Oort type of Artin–Schreier covers. [ABSTRACT FROM AUTHOR]

My first aim in this paper is to use time diagrams in the style of Brentano to analyze constructions in Brouwer's separable mathematics more precisely. I argue that constructions must involve not only pairing and projecting as basic operations guaranteed by the intuition of twoity, as sometimes assumed in the literature, but also a recalling operation. My second aim is to argue that Brouwer's views on the intuition of twoity and arithmetic lead to an ontological explosion. Redeveloping the constructions of natural numbers and systems sketched in an appendix to Brouwer's Cambridge lectures, I observe that the only plausible way he can make some elementary arithmetic in his separable mathematics is by allowing for the same canonical number to be determined by multiple separable entities, resulting in an overabundant mathematical ontology. [ABSTRACT FROM AUTHOR]

A new algorithm for computing Hecke operators for SL n was introduced in [14]. The algorithm uses tempered perfect lattices , which are certain pairs of lattices together with a quadratic form. These generalize the perfect lattices of Voronoi [17]. The present paper is the first step in characterizing tempered perfect lattices. We obtain a complete classification in the plane, where the Hecke operators are for SL 2 (Z) and its arithmetic subgroups. The results depend on the class field theory of orders in imaginary quadratic number fields. [ABSTRACT FROM AUTHOR]

With the rapid proliferation of the Internet of Things (IoT) in recent years, the number of IoT devices has surged exponentially. These devices collect and transmit vast amounts of data, including sensitive information. Encrypting data is a crucial means to prevent unauthorized access and potential misuse. However, the traditional cryptographic schemes offering robust security demand substantial device resources and are unsuitable for lightweight deployments, particularly in resource-constrained IoT devices. On the other hand, with the automotive industry making strides in autonomous driving, self-driving vehicles are beginning to integrate into people's daily lives. Ensuring the security of autonomous driving systems, particularly in preventing hacker infiltrations, is a paramount challenge currently facing the industry. An emerging lightweight sequence cipher—aiming to strike a balance between security and resource efficiency—has been proposed in this paper based on S-box substitution and arithmetic addition. The designed security threshold is 280. It has been verified that with a slight performance disadvantage, it can reduce memory usage while ensuring the security threshold. The key stream generated by this structure exhibits excellent pseudo-randomness. [ABSTRACT FROM AUTHOR]

Assume that we are given a sequence F of k homogeneous polynomials in n variables of degree at most d and the ideal ℐ generated by this sequence. The aim of this paper is to present a new and effective method to determine, within the arithmetic complexity d O (n) , whether F is regular. This algorithm has been implemented in Maple and its efficiency (compared to the classical approaches for regular sequence test) is evaluated via a set of benchmark polynomials. Furthermore, we show that if F is regular then we can transform ℐ into Nœther position and at the same time compute a reduced Gröbner basis for the transformed ideal within the arithmetic complexity d O (n 2) . Finally, under the same assumption, we establish the new upper bound 2 (d k / 2) 2 n − k − 1 for the maximum degree of the elements of any reduced Gröbner basis of ℐ in the case that n > k. [ABSTRACT FROM AUTHOR]

The Tree-Seed Algorithm (TSA) has been effective in addressing a multitude of optimization issues. However, it has faced challenges with early convergence and difficulties in managing high-dimensional, intricate optimization problems. To tackle these shortcomings, this paper introduces a TSA variant (DTSA). DTSA incorporates a suite of methodological enhancements that significantly bolster TSA's capabilities. It introduces the PSO-inspired seed generation mechanism, which draws inspiration from Particle Swarm Optimization (PSO) to integrate velocity vectors, thereby enhancing the algorithm's ability to explore and exploit solution spaces. Moreover, DTSA's adaptive velocity adaptation mechanism based on count parameters employs a counter to dynamically adjust these velocity vectors, effectively curbing the risk of premature convergence and strategically reversing vectors to evade local optima. DTSA also integrates the trees population integrated evolutionary strategy, which leverages arithmetic crossover and natural selection to bolster population diversity, accelerate convergence, and improve solution accuracy. Through experimental validation on the IEEE CEC 2014 benchmark functions, DTSA has demonstrated its enhanced performance, outperforming recent TSA variants like STSA, EST-TSA, fb-TSA, and MTSA, as well as established benchmark algorithms such as GWO, PSO, BOA, GA, and RSA. In addition, the study analyzed the best value, mean, and standard deviation to demonstrate the algorithm's efficiency and stability in handling complex optimization issues, and DTSA's robustness and efficiency are proven through its successful application in five complex, constrained engineering scenarios, demonstrating its superiority over the traditional TSA by dynamically optimizing solutions and overcoming inherent limitations. [ABSTRACT FROM AUTHOR]

Realizability notions in mathematical logic have a long history, which can be traced back to the work of Stephen Kleene in the 1940s, aimed at exploring the foundations of intuitionistic logic. Kleene's initial realizability laid the ground for more sophisticated notions such as Kreisel's modified realizability and various modern approaches. In this context, our work aligns with the lineage of realizability strategies that emphasize the accumulation, rather than the propagation of precise witnesses. In this paper, we introduce a new notion of realizability, namely herbrandized modified realizability. This novel form of (cumulative) realizability, presented within the framework of semi-intuitionistic logic is based on a recently developed star combinatory calculus, which enables the gathering of witnesses into nonempty finite sets. We also show that the previous analysis can be extended from logic to (Heyting) arithmetic. [ABSTRACT FROM AUTHOR]

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every prime p, we prove a sufficient condition for a finite group to be p-nilpotent, that is, a group whose elements of p ′ -order form a normal subgroup. Moreover, we characterize finite cyclic groups with prescribed number of prime divisors. [ABSTRACT FROM AUTHOR]

The rational field Q is highly desired in many applications. Algorithms using the rational number field Q algebraic number fields use only integer arithmetics and are easy to implement. Therefore, studying and designing systems and expansions with coefficients in Q or algebraic number fields is particularly interesting. This paper discusses constructing quasi-tight framelets with symmetry over an algebraic field. Compared to tight framelets, quasi-tight framelets have very similar structures but much more flexibility in construction. Several recent papers have explored the structure of quasi-tight framelets. The construction of symmetric quasi-tight framelets directly applies the generalized spectral factorization of 2 × 2 matrices of Laurent polynomials with specific symmetry structures. We adequately formulate the latter problem and establish the necessary and sufficient conditions for such a factorization over a general subfield F of C , including algebraic number fields as particular cases. Our proofs of the main results are constructive and thus serve as a guideline for construction. We provide several examples to demonstrate our main results. [ABSTRACT FROM AUTHOR]

Numerous papers have studied the problem of determining upper bounds for the number of integer points on elliptic curves of the form y 2 = x 3 − m x , and quartic curves of the form X 2 − d Y 4 = k. Bounds for the number of integer solutions to such quartic equations typically depend on both of the coefficients d , k. The purpose of this paper is to examine more closely how the number of integer points on such quartic curves seems to depend almost entirely on the number of prime factors of k. This is done by focusing in on the problem of bounding the number of squares in certain recurrence sequences. In particular, using some arithmetic on elliptic curves, it is proved that infinitely many such sequences can have four squares, but that a fifth square remains elusive after extensive computation, suggesting that an absolute bound for the number of squares is more than likely, and also suggesting that the above assertion regarding the dependence on the number of prime factors of k. [ABSTRACT FROM AUTHOR]

This paper presents an improved arithmetic optimization algorithm that incorporates hybrid elite pool strategies to address the limitations of the arithmetic optimization algorithm (AOA). In AOA, the linear mathematical optimization acceleration (MOA) function cannot balance global exploitation and local exploration well. Therefore, the accuracy and convergence speed of the algorithm cannot be guaranteed. To improve the performance of AOA, this paper reconstructed a nonlinear MOA function, which is expected to balance the exploitation and the exploration of AOA. Furthermore, four hybrid elite pool strategies are integrated to enhance the ability to escape local optima. The proposed algorithm inherits the fast convergence of AOA and develops the performance of escaping local optima. Numerical experiment results on benchmark functions and engineering problems show that the proposed algorithm outperforms other compared meta-heuristic algorithms in terms of convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

All-pass transformation (APT)-based variable digital filters (VDFs) can be used in different biomedical signal-processing applications, particularly in electrocardiograph denoising. In this paper, arithmetic optimised APT-VDF is proposed by modifying the hardware structure of APT-VDF based on arithmetic perception to enhance the performance in terms of area, speed and power consumption. The core blocks of the suggested Arithmetic Optimised APT-VDF (AOAPT-VDF)are adders and multipliers. This paper introduces a new reusable Vedic multiplier with redundant detection unit to identify redundant computations while generating the partial products. Also, a new Carry select adder (CSLA) with simplified combinational logics is proposed to improve the performance of the CSLA by simplifying the partial sum and carry generation logics without requiring Ripple Carry Adders. The proposed Reusable Vedic Multiplier with Redundant Detection Logic (RVM-RDL) also reuses the same vertical and cross-product generation units repetitively to reduce the area while increasing the bit length. The effectiveness of the suggested AOAPT is analysed utilising the MIT-BIH Arrhythmia Database. The proposed AOAPT-VDF consumes only 0.21 $$W$$ W power and achieves a 235.50 MHz operating frequency. [ABSTRACT FROM AUTHOR]

A group G is called residually finite if for every non-trivial element g ∈ G , there exists a finite quotient Q of G such that the element g is non-trivial in the quotient as well. Instead of just investigating whether a group satisfies this property, a new perspective is to quantify residual finiteness by studying the minimal size of the finite quotient Q depending on the complexity of the element g , for example by using the word norm ‖ g ‖ G if the group G is assumed to be finitely generated. The residual finiteness growth RF G : N → N is then defined as the smallest function such that if ‖ g ‖ G ≤ r , there exists a morphism φ : G → Q to a finite group Q with | Q | ≤ RF G (r) and φ (g) ≠ e Q. Although upper bounds have been established for several classes of groups, exact asymptotics for the function RF G are only known for very few groups such as abelian groups, the Grigorchuk group and certain arithmetic groups. In this paper, we show that the residual finiteness growth of virtually abelian groups equals log k for some k ∈ N , where the value k is given by an explicit expression. As an application, we show that for every m ≥ 1 and every 1 ≤ k ≤ m , there exists a group G containing a normal abelian subgroup of rank m and with RF G ≈ log k. [ABSTRACT FROM AUTHOR]

The article discusses the use of paper folding to build understanding of multiplicative relationships, which is a key goal of mathematics instruction in the upper elementary and middle grades. Multiplicative thinking includes comparing numbers through many processes, multiplication and division, ratio, proportions, stretching and shrinking, magnification, scaling, and splitting. The author explains that students tend to reason additively about multiplicative situations first, and are resistant to changing this approach, so teachers need to provide tasks that help students recognize and reason about multiplicative relationships. Paper folding is presented as a means of addressing both the development of multiplicative thinking and facilitating discussion of mathematical problems.

AbstractThe Huneke-Wiegand conjecture is a decades-long open question in commutative algebra. García-Sánchez and Leamer showed that a special case of this conjecture concerning numerical semigroup rings k[Γ] can be answered in the affirmative by locating certain arithmetic sequences within the numerical semigroup Γ. In this paper, we use their approach to prove the Huneke-Wiegand conjecture in the case where Γ is generated by a generalized arithmetic sequence and showcase how visualizations can be leveraged to find the requisite arithmetic sequences. [ABSTRACT FROM AUTHOR]

Fix an integer d ≥ 2 . The parameters c 0 ∈ Q ¯ for which the unicritical polynomial f d , c (z) = z d + c ∈ C [ z ] has finite postcritical orbit, also known as Misiurewicz parameters, play a significant role in complex dynamics. Recent work of Buff, Epstein, and Koch proved the first known cases of a long-standing dynamical conjecture of Milnor using their arithmetic properties, about which relatively little is otherwise known. Continuing our work from a companion paper, we address further arithmetic properties of Misiurewicz parameters, especially the nature of the algebraic integers obtained by evaluating the polynomial defining one such parameter at a different Misiurewicz parameter. In the most challenging such combinations, we describe a connection between such algebraic integers and the multipliers of associated periodic points. As part of our considerations, we also introduce a new class of polynomials we call p-special, which may be of independent number theoretic interest. [ABSTRACT FROM AUTHOR]

AbstractArithmetic achievement holds particular significance in contemporary times; however, students continue to encounter difficulties in this domain. Researchers and organizations are actively seeking factors that can support students in navigating mathematical content. To address this gap, we propose an examination of the role played by six soft skills (adaptability, curiosity, initiative, leadership, perseverance, and social awareness), alongside self-regulated learning strategies, academic motivation, achievement emotions, and fluid reasoning abilities, in students’ performance on standardized arithmetic tasks. Data were gathered from 551 Italian students aged 11–18 through classroom-based paper-and-pencil tasks and questionnaires. Path analysis results reveal that only fluid reasoning abilities, academic motivation, and negative achievement emotions significantly correlate with arithmetic performance. Soft skills demonstrate an indirect relationship with arithmetic performance, mediated by negative achievement emotions and academic motivation (while not mediated by positive achievement emotions and self-regulated learning strategies). These findings underscore the increasingly recognized significance of soft skills and expand their relevance to arithmetic achievement, potentially suggesting novel psychoeducational interventions to bolster students’ performance in this realm. [ABSTRACT FROM AUTHOR]

The architectonic is key for situating Kant's understanding of science in the coming century. For Kant the faculty of reason turns to ideas to form a complete system. The coherence of the system rests on these ideas. In contrast to technical unity which can be abstracted a posteriori, architectonic ideas are the source of a priori unity for the system of reason because they connect our reasonable pursuit to essential human ends. Given Kant's focus on mathematics, in the architectonic and his critical philosophy more generally, we must have some sense of the architectonic idea of mathematics. In this paper, I argue for the key principles of the architectonic idea of mathematics: 1) because mathematics is grounded in a priori intuition, it is a peculiarly human activity; 2) the method of mathematics is one of a priori construction, a method only mathematics can employ and: 3) the objects of mathematics are extensive magnitudes. Given these principles, we can use the architectonic idea to have some clarity about how mathematics has dealt with historical development. [ABSTRACT FROM AUTHOR]

A universal number (Unum) is a number representation format that can reduce the memory contention issues in multicore processors and parallel computing systems by optimizing the bit storage in the arithmetic operations. Given the safety-critical nature of applications of Unum format, there is a dire need to rigorously assess the correctness of the Unum based arithmetic operations. Unums are of three types, namely, Unum-I, Unum-II and Unum-III (commonly known as Posits). In this paper, we provide a higher-order-logic formalization of Unum-III (posits). In particular, we formally model a posit format (binary encoding of a posit), which is comprised of the sign, exponent, regime and fraction bits, using the HOL Light theorem prover. In order to prove the correctness of a posit format, we formally verify various properties regarding conversions of a real number to a posit and a posit to a real number and the scaling factors of the regime, exponent and fraction bits of a posit using HOL Light. [ABSTRACT FROM AUTHOR]

We investigate sections of the arithmetic fundamental group $\pi _1(X)$ where X is either a smooth affinoid p-adic curve , or a formal germ of a p-adic curve , and prove that they can be lifted (unconditionally) to sections of cuspidally abelian Galois groups. As a consequence, if X admits a compactification Y , and the exact sequence of $\pi _1(X)$ splits , then $\text {index} (Y)=1$. We also exhibit a necessary and sufficient condition for a section of $\pi _1(X)$ to arise from a rational point of Y. One of the key ingredients in our investigation is the fact, we prove in this paper in case X is affinoid, that the Picard group of X is finite. [ABSTRACT FROM AUTHOR]

The extensions of ordinary fuzzy sets are problematic because they require decimal numbers for membership, non-membership and indecision degrees of an element from the experts, which cannot be easily determined. This will be more difficult when three or more digits' membership degrees have to be assigned. Instead, proportional relations between the degrees of parameters of a fuzzy set extension will make it easier to determine the membership, non-membership, and indecision degrees. The objective of this paper is to present a simple but effective technique for determining these degrees with several decimal digits and to enable the expert to assign more stable values when asked at different time points. Some proportion-based models for the fuzzy sets extensions, intuitionistic fuzzy sets, Pythagorean fuzzy sets, picture fuzzy sets, and spherical fuzzy sets are proposed, including their arithmetic operations and aggregation operators. Proportional fuzzy sets require only the proportional relations between the parameters of the extensions of fuzzy sets. Their contribution is that these models will ease the use of fuzzy set extensions with the data better representing expert judgments. The imprecise definition of proportions is also incorporated into the given models. The application and comparative analyses result in that proportional fuzzy sets are easily applied to any problem and produce valid outcomes. Furthermore, proportional fuzzy sets clearly showed the role of the degree of indecision in the ranking of alternatives in binomial and trinomial fuzzy sets. In the considered car selection problem, it has been observed that there are minor changes in the ordering of intuitionistic and spherical fuzzy sets. [ABSTRACT FROM AUTHOR]

In this paper traveling wave solutions of the modified regularized and regularized long wave equations (MRLW & RLW equations) are simulated using modified trigonometric B-spline functions in collocation method. We validate the adaptability of the proposed method successfully by simulating single solitary wave motion, two and three solitary wave interactions. We also compute the three motion invariants numerically and these are found to be very very close with their analytical values. We also calculate 4 and Loo error norms for single solitary wave motion. Stability of the method is also discussed. Convergence rate for the proposed scheme is obtained numerically with respect to space step size. Computational complexity is analysed and it is found that the developed approach gives very good results with very less computational cost. in terms of the number of arithmetic operations, the computational complexity of the proposed method is found to be linear. [ABSTRACT FROM AUTHOR]

In this paper, the general case of normal discrete Hausdorff operators in L2(Rd) is studied. The main result states that under some natural arithmetic condition, the spectrum of such an operator is rotationally invariant. Several special cases and applications are considered. [ABSTRACT FROM AUTHOR]

Arithmetic optimization algorithm (AOA) is a meta-heuristic optimization method based on mathematical operators proposed in recent years. Although it has good performance, it can also lead to insufficient local search ability and falling into local optima when solving complex optimization problems. In order to make up for the above shortcomings, the optimization performance of AOA is further improved. This paper proposes a hybrid algorithm based on AOA and particle swarm optimization (PSO) called HAOAPSO. Firstly, a compound opposition-based learning (COBL) strategy is introduced to broaden the scope of finding optimal solutions to help the algorithm better jump out of local optima. Secondly, PSO is combined with AOA that integrates COBL to improve the algorithm's local search ability, so as to improve the overall search efficiency of the algorithm. In addition, experiments are performed on 23 classical benchmark functions with different characteristics and five engineering design optimization problems, and the experimental results of HAOAPSO are compared with those of other well-known optimization algorithms to comprehensively evaluate the performance of the proposed algorithm. The simulation results show that HAOAPSO can provide better solutions in most cases when solving global optimization problems such as engineering, with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

In this paper, we consider the forward rounding errors of the partial pivoting quaternion LU decomposition. To carry out error analysis of algorithms in quaternion arithmetic, we first propose the accuracy model for the basic quaternion arithmetic operations by the real structure-preserving method. And then, we study the forward rounding errors of the partial pivoting quaternion LU decomposition. Finally, by using the results of the forward rounding errors of the partial pivoting quaternion LU decomposition, we analyze the forward rounding errors of the nonsingular quaternion linear system. [ABSTRACT FROM AUTHOR]

Given a perfect field $k$ with algebraic closure $\overline {k}$ and a variety $X$ over $\overline {k}$ , the field of moduli of $X$ is the subfield of $\overline {k}$ of elements fixed by field automorphisms $\gamma \in \operatorname {Gal}(\overline {k}/k)$ such that the Galois conjugate $X_{\gamma }$ is isomorphic to $X$. The field of moduli is contained in all subextensions $k\subset k'\subset \overline {k}$ such that $X$ descends to $k'$. In this paper, we extend the formalism and define the field of moduli when $k$ is not perfect. Furthermore, Dèbes and Emsalem identified a condition that ensures that a smooth curve is defined over its field of moduli, and prove that a smooth curve with a marked point is always defined over its field of moduli. Our main theorem is a generalization of these results that applies to higher-dimensional varieties, and to varieties with additional structures. In order to apply this, we study the problem of when a rational point of a variety with quotient singularities lifts to a resolution. As a consequence, we prove that a variety $X$ of dimension $d$ with a smooth marked point $p$ such that $\operatorname {Aut}(X,p)$ is finite, étale and of degree prime to $d!$ is defined over its field of moduli. [ABSTRACT FROM AUTHOR]

In the present paper, we address the following general question in the framework of classical first-order logic. Assume that a certain mathematical principle can be formalized in a first-order language by a set E of conditional formulas of the form α (v) → β (v) . Given a base theory T, we can use the set of conditional formulas E to extend the base theory in two natural ways. Either we add to T each formula in E as a new axiom (thus obtaining a theory denoted by T + E ) or we extend T by using the formulas in E as instances of an inference rule (thus obtaining a theory denoted by T + E – Rule ). The theory T + E will be stronger than T + E – Rule , but how much stronger can T + E be? More specifically, is T + E conservative over T + E – Rule for theorems of some fixed syntactical complexity Γ ? Under very general assumptions on the set of conditional formulas E, we obtain two main conservation results in this regard. Firstly, if the formulas in E have low syntactical complexity with respect to some prescribed class of formulas Π and in the applications of E – Rule side formulas from the class Π and can be eliminated (in a certain precise sense), then T + E is ∀ B (Π) -conservative over T + E – Rule . Secondly, if, in addition, E is a finite set with m conditional sentences, then nested applications of E – Rule of a depth at most of m suffice to obtain ∀ B (Π) conservativity. These conservation results between axioms and inference rules extend well-known conservation theorems for fragments of first-order arithmetics to a general, purely logical framework. [ABSTRACT FROM AUTHOR]