Search

In this study, we developed a new method of topology optimization for truss structures by quantum annealing. To perform quantum annealing analysis with real variables, representation of real numbers as a sum of random number combinations is employed. The nodal displacement is expressed with binary variables. The Hamiltonian H is formulated on the basis of the elastic strain energy and position energy of a truss structure. It is confirmed that truss deformation analysis is possible by quantum annealing. For the analysis of the optimization method for the truss structure, the cross-sectional area of the truss is expressed with binary variables. The iterative calculation for the changes in displacement and cross-sectional area leads to the optimal structure under the prescribed boundary conditions. [ABSTRACT FROM AUTHOR]

Quantum annealing machines are next-generation computers for solving combinatorial optimization problems. Although physical simulations are one of the most promising applications of quantum annealing machines, a method how to embed the target problem into the machines has not been developed except for certain simple examples. In this study, we focus on a method of representing real numbers using binary variables, or quantum bits. One of the most important problems for conducting physical simulation by quantum annealing machines is how to represent the real number with quantum bits. The variables in physical simulations are often represented by real numbers but real numbers must be represented by a combination of binary variables in quantum annealing, such as quadratic unconstrained binary optimization (QUBO). Conventionally, real numbers have been represented by assigning each digit of their binary number representation to a binary variable. Considering the classical annealing point of view, we noticed that when real numbers are represented in binary numbers, there are numbers that can only be reached by inverting several bits simultaneously under the restriction of not increasing a given Hamiltonian, which makes the optimization very difficult. In this work, we propose three new types of real number representation and compared these representations under the problem of solving linear equations. As a result, we found experimentally that the accuracy of the solution varies significantly depending on how the real numbers are represented. We also found that the most appropriate representation depends on the size and difficulty of the problem to be solved and that these differences show a consistent trend for two annealing solvers. Finally, we explain the reasons for these differences using simple models, the minimum required number of simultaneous bit flips, one-way probabilistic bit-flip energy minimization, and simulation of ideal quantum annealing machine. [ABSTRACT FROM AUTHOR]

We study the Cantor real base numeration system which is a common generalization of two positional systems, namely the Cantor system with a sequence of integer bases and the Rényi system with one real base. We focus on the case of an alternate base B given by a purely periodic sequence (β n) n ≥ 1 of real numbers greater than 1. We answer an open question of Charlier et al. (J Number Theory 254:184–198, 2024, https://doi.org/10.1016/j.jnt.2023.07.008) on the set of numbers with eventually periodic B -expansions. We also investigate for which bases all sufficiently small rationals have a purely periodic B -expansion. We show that a necessary condition for this phenomenon is that δ = ∏ n = 1 p β n (where p is the period-length of B ) is a Pisot or a Salem unit. We also provide a sufficient condition. We thus generalize the results known for the Rényi numeration system, i.e. for the case when p = 1 . We provide a class of alternate bases in which all rational numbers in the interval [0, 1) have a purely periodic B -expansion. [ABSTRACT FROM AUTHOR]

Suppose (f,\mathcal {X},\mu) is a measure preserving dynamical system and \phi \colon \mathcal {X}\to \mathbb {R} a measurable function. Consider the maximum process M_n≔\max \{X_1,\ldots,X_n\}, where X_i=\phi \circ f^{i-1} is a time series of observations on the system. Suppose that (u_n) is a non-decreasing sequence of real numbers, such that \mu (X_1>u_n)\to 0. For certain dynamical systems, we obtain a zero–one measure dichotomy for \mu (M_n\leq u_n\,\text {i.o.}) depending on the sequence u_n. Specific examples are piecewise expanding interval maps including the Gauß map. For the broader class of non-uniformly hyperbolic dynamical systems, we make significant improvements on existing literature for characterising the sequences u_n. Our results on the permitted sequences u_n are commensurate with the optimal sequences (and series criteria) obtained by Klass (1985) for i.i.d. processes. Moreover, we also develop new series criteria on the permitted sequences in the case where the i.i.d. theory breaks down. Our analysis has strong connections to specific problems in eventual always hitting time statistics and extreme value theory. [ABSTRACT FROM AUTHOR]

Unfortunately, eleven of our provinces were severely affected due to two severe earthquakes that occurred in our country, the Republic of Turkey, on February 6, 2023. As a result, thousands of buildings were destroyed and tens of thousands of our citizens lost their lives. From past to present, such disasters have occurred in many parts of our world and will continue to happen. In order to raise awareness for researchers and academicians reading our article, we will give a new definition of convexity in this article, and we will call it "earthquake convexity". In this paper, we study some algebraic properties of the earthquake convexity. Then we compare the results obtained with both Hölder, Hölder–İşcan inequalities and power-mean, improved power-mean integral inequalities and show that the results obtained with Hölder–İşcan and improved power-mean inequalities are better than the others. Some applications to special means of real numbers are also given. [ABSTRACT FROM AUTHOR]

Let $\gcd (n_{1},\ldots ,n_{k})$ denote the greatest common divisor of positive integers $n_{1},\ldots ,n_{k}$ and let $\phi $ be the Euler totient function. For any real number $x>3$ and any integer $k\geq 2$ , we investigate the asymptotic behaviour of $\sum _{n_{1}\ldots n_{k}\leq x}\phi (\gcd (n_{1},\ldots ,n_{k})). $ [ABSTRACT FROM AUTHOR]

Einsteinian gravity, of which Newtonian gravity is a part, is fraught with the problem of singularity that has been established as a theorem by Hawking and Penrose. The hypothesis that founds the basis of both Einsteinian and Newtonian theories of gravity is that bodies with unequal magnitudes of masses fall with the same acceleration under the gravity of a source object. Since, the Einstein's equations is one of the assumptions that underlies the proof of the singularity theorem, therefore, the above hypothesis is implicitly one of the founding pillars of the same. In this work, I demonstrate how one can possibly write a non-singular theory of gravity which manifests that the above mentioned hypothesis is only valid in an approximate sense in the "large distance" scenario. To mention a specific instance, under the gravity of the earth, a 5 kg and a 500 kg fall with accelerations which differ by approximately 113.148 × 10 - 32 meter/sec 2 and the more massive object falls with less acceleration. Further, I demonstrate why the concept of gravitational field is not definable in the "small distance" regime which automatically justifies why the Einstein's and Newton's theories fail to provide any "small distance" analysis. In course of writing down this theory, I demonstrate why the continuum hypothesis as spelled out by Goedel, is undecidable. The theory has several aspects which provide the following realizations: (i) Descartes' self-skepticism concerning exact representation of numbers by drawing lines (ii) Born's wish of taking into account "natural uncertainty in all observations" while describing "a physical situation" by means of "real numbers" (iii) Klein's vision of having "a fusion of arithmetic and geometry" where "a point is replaced by a small spot" (iv) Goedel's assertion about "non-standard analysis, in some version" being "the analysis of the future". [ABSTRACT FROM AUTHOR]

The maximum function, on vectors of real numbers, is not differentiable. Consequently, several differentiable approximations of this function are popular substitutes. We survey three smooth functions which approximate the maximum function and analyze their convergence rates. We interpret these functions through the lens of tropical geometry, where their performance differences are geometrically salient. As an application, we provide an algorithm which computes the max-convolution of two integer vectors in quasi-linear time. We show this algorithm's power in computing adjacent sums within a vector as well as computing service curves in a network analysis application. [ABSTRACT FROM AUTHOR]

As the terminal of the power system, the distribution network is the main area where failures occur. In addition, with the integration of distributed generation, the traditional distribution network becomes more complex, rendering the conventional fault location algorithms based on a single power supply obsolete. Therefore, it is necessary to seek a new algorithm to locate the fault of the distributed power distribution network. In existing fault localization algorithms for distribution networks, since there are only two states of line faults, which can usually be represented by 0 and 1, most algorithms use discrete algorithms with this characteristic for iterative optimization. Therefore, this paper combines the advantages of the particle swarm algorithm and genetic algorithm and uses continuous real numbers for iteration to construct a successive particle swarm genetic algorithm (SPSO-GA) different from previous algorithms. The accuracy, speed, and fault tolerance of SPSO-GA, discrete particle swarm Genetic algorithm, and artificial fish swarm algorithm are compared in an IEEE33-node distribution network with the distributed power supply. The simulation results show that the SPSO-GA algorithm has high optimization accuracy and stability for single, double, or triple faults. Furthermore, SPSO-GA has a rapid convergence velocity, requires fewer particles, and can locate the fault segment accurately for the distribution network containing distorted information. [ABSTRACT FROM AUTHOR]

For two given idempotents p and q from an associative algebra A , in this paper, we offer a comprehensive classification of algebras spanned by the idempotents p and q. This classification is based on the condition that p and q are not tightly coupled and satisfy (p q) m − 1 = (p q) m but (p q) m − 2 p ≠ (p q) m − 1 p for some m (≥ 2) ∈ N. Subsequently, we categorize all the group invertible elements and establish an upper bound for the Drazin index of any elements in these algebras spanned by p , q. Moreover, we formulate a new representation for the Drazin inverse of α p + q under two different assumptions, (p q) m − 1 = (p q) m and λ (p q) m − 1 = (p q) m , where α is a non-zero and λ is a non-unit real or complex number. [ABSTRACT FROM AUTHOR]

We prove that a Finsler spacetime endowed with a smooth reference measure whose induced weighted Ricci curvature \mathrm {Ric}_N is bounded from below by a real number K in every timelike direction satisfies the timelike curvature-dimension condition \mathrm {TCD}_q(K,N) for all q\in (0,1). The converse and a nonpositive-dimensional version (N \le 0) of this result are also shown. Our discussion is based on the solvability of the Monge problem with respect to the q-Lorentz–Wasserstein distance as well as the characterization of q-geodesics of probability measures. One consequence of our work is the sharp timelike Brunn–Minkowski inequality in the Lorentz–Finsler case. [ABSTRACT FROM AUTHOR]

For a set Q of points in the plane and a real number δ ≥ 0 , let G δ (Q) be the graph defined on Q by connecting each pair of points at distance at most δ .We consider the connectivity of G δ (Q) in the best scenario when the location of a few of the points is uncertain, but we know for each uncertain point a line segment that contains it. More precisely, we consider the following optimization problem: given a set P of n - k points in the plane and a set S of k line segments in the plane, find the minimum δ ≥ 0 with the property that we can select one point p s ∈ s for each segment s ∈ S and the corresponding graph G δ (P ∪ { p s ∣ s ∈ S }) is connected. It is known that the problem is NP-hard. We provide an algorithm to exactly compute an optimal solution in O (f (k) n log n) time, for a computable function f (·) . This implies that the problem is FPT when parameterized by k. The best previous algorithm uses O ((k !) k k k + 1 · n 2 k) time and computes the solution up to fixed precision. [ABSTRACT FROM AUTHOR]

Gronwall–Bellman-type inequalities provide a very effective way to investigate the qualitative and quantitative properties of solutions of nonlinear integral and differential equations. In recent years, local fractional calculus has attracted the attention of many researchers. In this paper, based on the basic knowledge of local fractional calculus and the method of proving inequality on the set of real numbers, some new Gronwall–Bellman inequalities are discussed and established on the fractal space. Our results are a powerful supplement to the existing literature. [ABSTRACT FROM AUTHOR]

On the assumption of the Riemann hypothesis and a spacing hypothesis for the nontrivial zeros $1/2+i\gamma$ of the Riemann zeta function, we show that the sequence \begin{equation*}\Gamma_{[a, b]} =\Bigg\{ \gamma : \gamma>0 \quad \mbox{and} \quad \frac{ \log\big(| \zeta^{(m_{\gamma })} (\frac12+ i{\gamma }) | / (\!\log{{\gamma }})^{m_{\gamma }}\big)}{\sqrt{\frac12\log\log {\gamma }}} \in [a, b] \Bigg\},\end{equation*} where the ${\gamma }$ are arranged in increasing order, is uniformly distributed modulo one. Here a and b are real numbers with $a , and $m_\gamma$ denotes the multiplicity of the zero $1/2+i{\gamma }$. The same result holds when the ${\gamma }$ 's are restricted to be the ordinates of simple zeros. With an extra hypothesis, we are also able to show an equidistribution result for the scaled numbers $\gamma (\!\log T)/2\pi$ with ${\gamma }\in \Gamma_{[a, b]}$ and $0. [ABSTRACT FROM AUTHOR]

In this note we show that given an indeterminate Hamburger moment sequence, it is possible to perturb the first moment in such way that the obtained sequence remains an indeterminate Hamburger moment sequence. As a consequence we prove that every sequence of real numbers is a moment sequence for a signed discrete measure supported in R+. [ABSTRACT FROM AUTHOR]

For a given sequence A of nonnegative integers, let P (A) be the set of all finite subsequence sums of A. A is called complete if P (A) contains all sufficiently large integers. A real number α > 0 is called as an infinite diadical fraction (briefly i.d.f.) if the digit 1 appears infinitely many times in the binary representation of α. Hegyvári conjectured that A α , β is complete if α or β is i.d.f. and α / β ≠ 2 l (l ∈ ℤ) , where A α , β = { [ α ] , [ β ] , ... , [ 2 n α ] , [ 2 n β ] , ... } is a sequence of integers. In this paper, we give a partial result of Hegyvári's conjecture. [ABSTRACT FROM AUTHOR]

For any two real-valued continuous-path martingales X = {Xt}t≥0 and Y = {Yt}t≥0, with X and Y being orthogonal and Y being differentially subordinate to X, we obtain sharp Lp inequalities for martingales of the form aX + bY with a, b real numbers. The best Lp constant is equal to the norm of the operator aI + bH from Lp to Lp, where H is the Hilbert transform on the circle or real line. The values of these norms were found by Hollenbeck, Kalton and Verbitsky [Studia Math., 2003, 157(3): 237–278]. We also give applications of our martingale inequalities to Riesz transforms and some discrete operators. [ABSTRACT FROM AUTHOR]

Efficient representation of data is a fundamental prerequisite for addressing computational problems effectively using computers. The continual improvement in methods for representing numbers in computers serves as a critical step in expanding the scope and capabilities of computing systems. In this research, we conduct a comprehensive review of both fundamental and advanced techniques for representing numbers in computers. Additionally, we propose a novel model capable of representing rational numbers with absolute precision, catering to specific high precision applications. Specifically, we adopt fractional positional notation coupled with explicit codification of the periodic parts, thereby accommodating the entire rational number set without any loss of accuracy. We elucidate the properties and hardware representation of this proposed format and provide the results of extensive experiments to demonstrate its expressiveness and minimal codification error when compared to other real number representation formats. This research contributes to the advancement of numerical representation in computer systems, empowering them to handle complex computations with heightened accuracy, making them more reliable and versatile in a wide range of applications. [ABSTRACT FROM AUTHOR]

In this paper, we expand the theory of semi-vector spaces and semi-algebras, both over the semi-field of nonnegative real numbers R 0 + . More precisely, we prove several new results concerning these theories. We introduce to the literature the concept of eigenvalues and eigenvectors of a semi-linear operator, describing how to compute them. The topological properties of semi-vector spaces, such as completeness and separability, are also investigated here. New families of semi-vector spaces derived from the semi-metric, semi-norm and semi-inner product, among others, are exhibited. Furthermore, we show several new results concerning semi-algebras. After this theoretical approach, we apply such a theory in fuzzy automata. More precisely, we describe the semi-algebra of A-fuzzy regular languages and we apply the theory of fuzzy automata for counting patterns in DNA sequences. [ABSTRACT FROM AUTHOR]

We study the properties of the constructive linear programming problems. The parameters of linear functions in such problems are constructive real numbers. Solving such a problem involves finding the optimal plan with the constructive real number components. We show that it is impossible to have an algorithm that solves an arbitrary constructive real programming problem. [ABSTRACT FROM AUTHOR]

Let (V, E) be a finite connected graph. We are concerned about the Chern–Simons Higgs model 0.1 Δ u = λ e u (e u - 1) + f , where Δ is the graph Laplacian, λ is a real number and f is a function on V. When λ > 0 and f = 4 π ∑ i = 1 N δ p i , N ∈ N , p 1 , ⋯ , p N ∈ V , the equation (0.1) was investigated by Huang et al. (Commun Math Phys 377:613–621, 2020) and Hou and Sun (Calc Var 61:139, 2022) via the upper and lower solutions principle. We now consider an arbitrary real number λ and a general function f, whose integral mean is denoted by f ¯ , and prove that when λ f ¯ < 0 , the equation (0.1) has a solution; when λ f ¯ > 0 , there exist two critical numbers Λ ∗ > 0 and Λ ∗ < 0 such that if λ ∈ (Λ ∗ , + ∞) ∪ (- ∞ , Λ ∗) , then (0.1) has at least two solutions, including one local minimum solution; if λ ∈ (0 , Λ ∗) ∪ (Λ ∗ , 0) , then (0.1) has no solution; while if λ = Λ ∗ or Λ ∗ , then (0.1) has at least one solution. Our method is calculating the topological degree and using the relation between the degree and the critical group of a related functional. Similar method is also applied to the Chern–Simons Higgs system, and a partial result for the multiple solutions of the system is obtained. [ABSTRACT FROM AUTHOR]

In this paper, we consider the following elliptic system - Δ u = | v | p - 1 v + ϵ (α u + β 1 v) , in Ω , - Δ v = | u | q - 1 u + ϵ (β 2 u + α v) , in Ω , u = v = 0 , on ∂ Ω , where Ω is a smooth bounded domain in R N , N ≥ 3 , ϵ is a small parameter, α , β 1 and β 2 are real numbers, (p, q) is a pair of positive numbers lying on the critical hyperbola 1 p + 1 + 1 q + 1 = N - 2 N. We first revisited the blowing-up solutions constructed in Kim and Pistoia (J Funct Anal 281(2):58, 2021) and then we proved its non-degeneracy. We believe that the various new ideas and technique computations that we used in this paper would be very useful to deal with other related problems involving critical Halmitonian system and the construction of new solutions. [ABSTRACT FROM AUTHOR]

Let G${\bf G}$ be a linear algebraic group, not necessarily connected or reductive, over the field of real numbers R${\mathbb {R}}$. We describe a method, implemented on computer, to find the first Galois cohomology set H1(R,G)${\rm H}^1({\mathbb {R}},{\bf G})$. The output is a list of 1‐cocycles in G${\bf G}$. Moreover, we describe an implemented algorithm that, given a 1‐cocycle z∈Z1(R,G)$z\in {\rm Z}^1({\mathbb {R}}, {\bf G})$, finds the cocycle in the computed list to which z$z$ is equivalent, together with an element of G(C)${\bf G}({\mathbb {C}})$ realizing the equivalence. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a biparametrized multiplicative integral identity and employ it to establish a collection of inequalities for multiplicatively convex mappings. These inequalities encompass several novel findings and refinements of established results. To enhance readers' comprehension, we offer illustrative examples that highlight appropriate choices of multiplicatively convex mappings along with graphical representations. Finally, we demonstrate the applicability of our results to special means of real numbers within the realm of multiplicative calculus. [ABSTRACT FROM AUTHOR]

Fuzzy multi-attribute decision-making is a hot research topic in which weight information is one of the conditions for forming a complete decision-making model, and it is also an important factor affecting the decision result. In most fuzzy multi-attribute decision-making problems, the weight information is often given in the form of real numbers. However, in real life, the weight information may not be suitable for specific numerical representation, or we cannot accurately determine the weight information. Therefore, it is very important to use fuzzy numbers to represent weight information. In this paper, we study the problem of disturbing fuzzy multi-attribute decision-making in which the attribute weight, decision-maker weight, and attribute information are given in the form of disturbing fuzzy numbers. Firstly, a new disturbing fuzzy integration operator, namely the disturbing fuzzy ring and multiplication aggregation (DFRMA) operator, is proposed, and its characteristics of closure, monotonicity, and boundary are studied. Then, the general steps of the disturbing fuzzy multi-attribute decision method based on the disturbing fuzzy ring and multiplication aggregation (DFRMA) operator are given, which include the single decision step and group decision step. Finally, an example is given to illustrate the practicability and effectiveness of the method. [ABSTRACT FROM AUTHOR]

Based on the previous studies, we make further research on how fractal dimensions of graphs of fractal continuous functions under operations change and obtain a series of new results in this paper. Initially, it has been proven that a positive continuous function under unary operations of any nonzero real power and the logarithm taking any positive real number that is not equal to one as the base number can keep the fractal dimension invariable. Then, a general method to calculate the Box dimension of two continuous functions under binary operations has been proposed. Using this method, the lower and upper Box dimensions of the product and the quotient of continuous functions without zero points have been investigated. On this basis, these conclusions will be generalized to the ring of rational functions. Furthermore, we discuss the Hölder continuity of continuous functions under operations and then prove that a Lipschitz function can be absorbed by any other continuous functions under certain binary operations in the sense of fractal dimensions. Some elementary results for vector-valued continuous functions have also been given. [ABSTRACT FROM AUTHOR]

In this paper, the fractional problem of the Ambrosetti-Prodi type involving the critical Sobolev exponent is taken into account in a bounded domain of R N { A α u = u + 2 α ⁎ − 1 + λ u − s ¯ φ 1 , u > 0 , in Ω , u = 0 , on ∂ Ω , where A α is the spectral fractional operator, λ and s ¯ are real numbers, Ω ⊂ R N is bounded, 2 α ⁎ = 2 N N − 2 α is a critical exponent, 0 < α < 1 , φ 1 is the first eigenfunction of −Δ with zero Dirichlet boundary condition. We will construct bubbling solutions when the parameter is large enough, and the location of the bubbling point is near the boundary of the domain. [ABSTRACT FROM AUTHOR]

We introduce a novel multiparameterized fractional multiplicative integral identity and utilize it to derive a range of inequalities for multiplicatively s-convex mappings in connection with different quadrature rules involving one, two, and three points. Our results cover both new findings and established ones, offering a holistic framework for comprehending these inequalities. To validate our outcomes, we provide an illustrative example with visual aids. Furthermore, we highlight the practical significance of our discoveries by applying them to special means of real numbers within the realm of multiplicative calculus. [ABSTRACT FROM AUTHOR]

Kleene's computability theory based on the S1–S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's 'machine model' which formalises computing with real numbers. A fundamental distinction in Kleene's framework is between normal and non-normal functionals where the former compute the associated Kleene quantifier ∃ n and the latter do not. Historically, the focus was on normal functionals, but recently new non-normal functionals have been studied based on well-known theorems, the weakest among which seems to be the uncountability of the reals. These new non-normal functionals are fundamentally different from historical examples like Tait's fan functional: the latter is computable from ∃ 2 , while the former are computable in ∃ 3 but not in weaker oracles. Of course, there is a great divide or abyss separating ∃ 2 and ∃ 3 and we identify slight variations of our new non-normal functionals that are again computable in ∃ 2 , i.e. fall on different sides of this abyss. Our examples are based on mainstream mathematical notions, like quasi-continuity, Baire classes, bounded variation, and semi-continuity from real analysis. [ABSTRACT FROM AUTHOR]

Based on an extension of Riemann sums, Moore and Yang have defined an integral notion for the context of continuous inclusion monotonic interval functions in which the limits of integration are real numbers. This integral notion generalizes the usual one for real-valued functions based on Riemann sums. In this paper we extend this approach by considering intervals as limits of integration and abolishing the inclusion monotonic restriction of the integrable interval functions. Also, such a new integration notion is used to define interval probability density functions and use it in interval probability distribution functions. [ABSTRACT FROM AUTHOR]

Trapezoidal positive/negative fuzzy numbers have no single definition; instead, various authors define them in relation to different concepts. This means that arithmetic operations for trapezoidal fuzzy numbers also differ. For the operations of addition, subtraction, and scalar multiplication, there are not many differences; for multiplication, however, there are many differences. In general, multiplication is divided into various cases. For the inverse operation, there is not much to define; in general, for any trapezoidal fuzzy number u ~ ,   u ~ ⊗ 1 u ~ = i ~ = (1 , 1 , 0 , 0) does not necessarily apply. As a result of the different arithmetic operations for multiplication and division employed by various authors, several researchers have tackled the same problem and reached different solutions, meaning that the application will also produce different results. To date, many authors have proposed various alternatives for the algebra of the trapezoidal fuzzy number. In this paper, using the parametric form approach to trapezoidal fuzzy numbers, an alternative to multiplication with only one formula is constructed for various cases. Furthermore, based on the definition of multiplication for any trapezoidal fuzzy number, u ~ is constructed 1 u ~ so that u ~ ⊗ 1 u ~ = i ~ = (1 , 1 , 0 , 0) . Based on these conditions, we show that various properties that apply to real numbers also apply to any trapezoidal fuzzy number. Furthermore, we modify the elementary row operational steps for the trapezoidal fuzzy number matrix, which can be used to determine the inverse of a trapezoidal fuzzy number matrix with the order m × m . We also give the steps and examples necessary to determine the general inverse for a trapezoidal fuzzy number matrix of the order m × n with m   ≠ n . This ability to easily determine the inverse and general inverse of a trapezoidal fuzzy number matrix has a number of applications, such as solving fully trapezoidal fuzzy number linear systems and fuzzy transportation problems, especially in applications in fields outside of mathematics; for example, the application of triangular fuzzy numbers in medical problems is a topic currently receiving a significant amount of attention. [ABSTRACT FROM AUTHOR]

Denote by τ k (n) , ω (n) and μ 2 (n) the number of representations of n as a product of k natural numbers, the number of distinct prime factors of n and the characteristic function of the square-free integers, respectively. Let [ t ] be the integral part of real number t. For f = ω , 2 ω , μ 2 , τ k , we prove that ∑ n ≤ x f x n = x ∑ d ≥ 1 f (d) d (d + 1) + O (x f + ) for x → ∞ , where ω = 5 3 1 1 0 , 2 ω = 9 1 9 , μ 2 = 2 5 , τ k = 5 k − 1 1 0 k − 1 and > 0 is an arbitrarily small positive number. These improve the corresponding results of Bordellès. [ABSTRACT FROM AUTHOR]

Let (t (m)) m ≥ 0 be Thue-Morse sequence and b > 2 be an integer. In this paper, we prove that the real numbers 1 , ∑ m = 0 ∞ t (m 2) b m + 1 and ∑ m = 0 ∞ t (m 3) b m + 1 are linearly independent over Q . [ABSTRACT FROM AUTHOR]

Although different social crises may eventually favor undemocratic and authoritarian forms of governance, at some point, such antidemocratic practices require the support of a significant part of the population to be implemented. The present research investigates how and whether the COVID‐19 pandemic might have favoured greater support for antidemocratic governmental practices, on the premise of regaining control and security. Using data from 17 countries (N = 4364) and national‐level indicators (i.e., real number of contagions and deaths, and sociopolitical indicators), we test how the risk of contagion and death from COVID‐19, along with personal orientations (i.e., social dominance orientation [SDO], right‐wing authoritarianism [RWA], and perceived anomie) motivate authoritarian and antidemocratic practices. Results from multilevel models indicate that risk perception and perceptions of political instability predict a wish for stronger leadership, agreement with martial law, and support for a controlling government especially when SDO and RWA are high, while more egalitarian and less conservative people agree less with these authoritarian measures in spite of the levels of risk perception. We discuss the implications for these findings for future research on similar but also dissimilar external events (natural disasters, war, or terror incidents) and the consequences for societies with higher authoritarian tendencies. [ABSTRACT FROM AUTHOR]

Let be an array of martingale difference random vectors and be an array of m × d matrices of real numbers. In this paper, the Marcinkiewicz–Zygmund type weak law of large numbers for maximal weighted sums of martingale difference random vectors is obtained with not necessarily finite p-th (1 < p < 2) moments. Moreover, the complete convergence and strong law of large numbers are established under some mild conditions. An application to multivariate simple linear regression model is also provided. [ABSTRACT FROM AUTHOR]

We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger completeness results for various computational problems. We exhibit several families of complete problems which can be used for future completeness results in the real hierarchy. As an application we sharpen some results by Bürgisser and Cucker on the complexity of properties of semialgebraic sets, including the Hausdorff distance problem also studied by Jungeblut, Kleist, and Miltzow. [ABSTRACT FROM AUTHOR]

We prove a sharp upper bound for the resurgence of sums of ideals involving disjoint sets of variables, strengthening work of Bisui–Hà–Jayanthan–Thomas [Collect. Math. 72 (2021), pp. 605–614]. Complete solutions are delivered for two conjectures proposed by these authors. For given real numbers a and b, we consider the set Res(a,b) of possible values of the resurgence of I+J where I and J are ideals in disjoint sets of variables having resurgence a and b, respectively. Some questions and partial results about Res(a,b) are discussed. [ABSTRACT FROM AUTHOR]

We study some properties of spaces obtained by interpolation of the Sobolev spaces Wk,1(Rd) and Wl,∞(Rd), where l and r are nonnegative integers, and d≥2. We are concerned with the standard real and complex methods of interpolation. In the case of the real method, an old result of De Vore and Scherer (1979) gives that (Wl,1 (Rd),Wl,∞(Rd))θ,pθ​​=Wl,pθ​(Rd), where θ∈(0,1) and 1/pθ​=1−θ. We complement this result by considering the case l ≠ r. We prove that, when l ≠ r, (Wl,1(Rd),Wr,∞(Rd))θ,q​=Bqσ,q, ​(Rd),(⋆) where σ:=(1−θ)l+θr and 1/q=1−θ, if and only if l−r∈R∖[1,d]. Also, we prove a similar fact when Wl,¹ is replaced in (⋆) by a space Ws,p where s ≠ r is a real number and p∈(1,∞). Several other problems like the boundedness of the Riesz transforms on interpolation spaces are also considered. In the case of the complex method, it was proved by M. Milman (1983) that, for any 1

The paper investigates a new type of contraction called (M, K, ψ)-HR-Ćirić-Reich-Rus contractions, which extends the existing research on Ćirić-Reich-Rus contraction mappings. We prove fixed point theorems by enriching (M, K, ψ)-HR-Ćirić-Reich-Rus contractions with respect to the asymptotic regularity of generalized averaged mappings. These mappings are denoted as Tφ = (1 - φ) I + φT, where I is the identity map and φ is a function from a normed space to real numbers. [ABSTRACT FROM AUTHOR]

The aim of this article is to find a geometric and physical interpretation of fractional order derivatives for a general class of functions defined over a bounded or unbounded domain. We show theoretically and geometrically that the absolute value of the fractional derivative value of a function is inversely proportional to the area of the triangle. Further, we prove geometrically that the fractional derivatives are inversely proportional to the classical integration in some sense. The established results are verified numerically for non‐monotonic, trigonometric, and power functions. Further, this article establishes a significant connection between the area of the projected fence and the area of triangles. As the area of triangles decreases, the area of the projected fence increases, and vice versa. We calculate the turning points of the fractional derivative values of different functions with respect to order α$$ \alpha $$, including non‐monotonic, trigonometric, and power functions. In particular, we demonstrate that for the power function xβ$$ {x}^{\beta } $$, with β$$ \beta $$ being a positive real number, the value α=0.5$$ \alpha =0.5 $$ is a turning point when x=β$$ x=\beta $$. However, for x>β$$ x>\beta $$, the turning point shifts to the left of point (0.5,0)$$ \left(0.5,0\right) $$ and shifts to the right of point (0.5,0)$$ \left(0.5,0\right) $$ for x<β.$$ x<\beta. $$ We discuss the physical interpretation of fractional order derivatives in terms of fractional divergence. We present some applications of fractional tangent lines in the field of numerical analysis. [ABSTRACT FROM AUTHOR]

The symmetric nonnegative inverse eigenvalue problem (SNIEP) is the problem of characterizing all possible spectra of entry-wise nonnegative symmetric matrices of given dimension. A list of real numbers is said to be symmetrically realizable if it is the spectrum of some nonnegative symmetric matrix. One of the most general sufficient conditions for realizability is the so-called C-realizability, which amounts to some kind of compensation between the positive and negative entries of the list of real numbers whose realizability one is trying to decide. A combinatorial characterization of C-realizable lists with zero trace was given in [11]. In this paper we make use of a recursive method for constructing simmetrically realizable lists due to Ellard and Šmigoc [3] to extend this combinatorial characterization of C-realizability to general lists with nonnegative trace. One consequence of this characterization is that the set of nonnegative C-realizable lists is a union of polyhedral cones whose faces are described by equations involving only linear combinations with coefficients 1 and −1 of the entries in the list. Another remarkable consequence is the monotonicity of C-realizability, i.e., the operation of increasing any positive entry of a C-realizable list preserves C-realizability. [ABSTRACT FROM AUTHOR]

In this paper, we construct a class of Z 4 Z 4 Z 4 -additive cyclic codes generated by 3-tuples of polynomials. We discuss their algebraic structure and show that generator matrices can be constructed for all codes in this class. We study asymptotic properties of this class of codes by using a Bernoulli random variable. Moreover, let 0 < δ < 1 be a real number such that the entropy h 4 ((k + l + t) δ 6) < 1 4 , we show that the relative minimum distance converges to δ and the rate of the random codes converges to 1 k + l + t , where k, l, and t are pairwise co-prime positive odd integers. Finally, we conclude that the Z 4 Z 4 Z 4 -additive cyclic codes are asymptotically good. [ABSTRACT FROM AUTHOR]

Let b ≥ 2 be an integer and A = (a n) n = 1 ∞ be a strictly increasing subsequence of positive integers with η : = lim sup n → ∞ a n + 1 a n < + ∞. For each irrational real number ξ , we denote by v ˆ b , A (ξ) the supremum of the real numbers v ˆ for which, for every sufficiently large integer N , the equation ‖ b a n ξ ‖ < (b a N ) − v ˆ has a solution n with 1 ≤ n ≤ N. For every v ˆ ∈ [ 0 , η ] , let V ˆ b , A (v ˆ) ( V ˆ b , A ⁎ (v ˆ)) be the set of all real numbers ξ such that v ˆ b , A (ξ) ≥ v ˆ ( v ˆ b , A (ξ) = v ˆ) respectively. In this paper, we give some results of the Hausdorfff dimensions of V ˆ b , A (v ˆ) and V ˆ b , A ⁎ (v ˆ). When η = 1 , we prove that the Hausdorfff dimensions of V ˆ b , A (v ˆ) and V ˆ b , A ⁎ (v ˆ) are equal to (1 − v ˆ 1 + v ˆ ) 2 for any v ˆ ∈ [ 0 , 1 ]. When η > 1 and lim n → ∞ ⁡ a n + 1 a n exists, we show that the Hausdorfff dimension of V ˆ b , A (v ˆ) is strictly less than (η − v ˆ η + v ˆ ) 2 for some v ˆ , which is different with the case η = 1 , and we give a lower bound of the Hausdorfff dimensions of V ˆ b , A (v ˆ) and V ˆ b , A ⁎ (v ˆ) for any v ˆ ∈ [ 0 , η ]. Furthermore, we show that this lower bound can be reached for some v ˆ. [ABSTRACT FROM AUTHOR]

In this article we define and study a zeta function ζ G —similar to the Hasse-Weil zeta function—which enumerates absolutely irreducible representations over finite fields of a (profinite) group G. This Weil representation zeta function converges on a complex half-plane for all UBERG groups and admits an Euler product decomposition. Our motivation for this investigation is the observation that the reciprocal value ζ G (k) - 1 at a sufficiently large integer k coincides with the probability that k random elements generate the completed group ring of G. The explicit formulas obtained so far suggest that ζ G is rather well-behaved. A central object of this article is the Weil abscissa, i.e., the abscissa of convergence a(G) of ζ G . We calculate the Weil abscissae for free abelian, free abelian pro-p, free pro-p, free pronilpotent and free prosoluble groups. More generally, we obtain bounds (and sometimes explicit values) for the Weil abscissae of free pro- C groups, where C is a class of finite groups with prescribed composition factors. We prove that every real number a ≥ 1 is the Weil abscissa a(G) of some profinite group G. In addition, we show that the Euler factors of ζ G are rational functions in p - s if G is virtually abelian. For finite groups G we calculate ζ G using the rational representation theory of G. [ABSTRACT FROM AUTHOR]

The harmonic polynomial was defined in order to understand better the harmonic topological index. Here, we obtain several properties of this polynomial, and we prove that several properties of a graph can be deduced from its harmonic polynomial. Also, we prove that graphs with the same harmonic polynomial share many properties although they are not necessarily isomorphic. [ABSTRACT FROM AUTHOR]

We prove the existence of nontrivial closed surfaces with constant anisotropic mean curvature with respect to elliptic integrands in closed smooth 3$\hskip.001pt 3$–dimensional Riemannian manifolds. The constructed min‐max surfaces are smooth with at most one singular point. The constant anisotropic mean curvature can be fixed to be any real number. In particular, we partially solve a conjecture of Allard in dimension 3$\hskip.001pt 3$. [ABSTRACT FROM AUTHOR]

We consider a very weak chain condition for a poset, that is the absence of subsets which are order isomorphic to the set of real numbers in their natural ordering; we study generalised radical groups in which this finiteness condition is set on the poset of subgroups which do not have certain properties which are generalizations of normality. This completes many previous results which considered (apparently) stronger chain conditions. [ABSTRACT FROM AUTHOR]