Search

This paper is devoted to some counting functions of level one and level three in the case of quotient space generated by some strictly hyperbolic Fuchsian group and the upper half-plane. Each of the functions is represented as a sum of some explicit part plus the error term. The explicit part is indexed over singularities of the corresponding Selberg zeta function. In particular, the obtained error term is not larger than O ( x 3/4) . The method applied in this paper follows traditional approach for achieving the error terms in the case of locally symmetric spaces of real rank one. In order to establish an analogy with the classical case, we consider the counting functions divided by x and x3, respectively.

In this paper, we use stochastic integration in the framework of signed measures, together with the technique of time changes. Let Q be a bounded non-null signed measure on $$(\varOmega ,{\mathcal {F}}, {{P}}),$$ such that $$\left| Q\right| $$ and P are equivalent. In the first part of the paper, we generalize the results of stochastic calculus in Beghdadi-Sakrani (Seminaire de probabilites XXXVI, Springer, 2003) to Q-local martingales and we give some examples. In the second part, we prove that the class of Q-semimartingales is invariant under time changes. We establish the famous formulas of time-changed local martingales as well as the representation of a Q-local martingale as a time-changed Brownian motion.

This paper is a condensation of my arXiv monograph entitled Schwartz “The phase transition in 5 point energy minimization”, 2016. arXiv:1610.03303, which contains a complete proof that there is a constant such that the triangular bi-pyramid is the minimizer, amongst all 5 point configurations on the sphere, with respect to the power law potential $$R_s(r)=\mathrm{sign}(s)/r^s$$, if and only if . In this paper we explain the main ideas and give proofs for some of the key lemmas.

Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects of a category of hypergraphic automata are universal hypergraphic automata. The input symbol semigroup of such automaton is an algebra of mappings which is considered as a derivative algebraic system for such automaton. Semigroup properties of the derivative algebraic system are interconnected with properties of the automaton. Thus, we can obtain a lot of information about a universal hypergraphic automaton studying its input symbol semigroups. In this paper, we found an abstract characterization of universal hypergraphic automata and an abstract characterization of input symbol semigroups of such automata. The results of the paper present effective tools for further analysis of the interrelation of algebraic and elementary properties of universal hypergraphic automata and their input symbol semigroups.

It is known that Julia sets, as a rule, have a fractal structure. In this paper, we give examples of smooth Julia sets, among them: a circle, a segment, an infinite interval, a straight line, and the complex plane. It is shown that the functions studied in the paper are chaotic on their Julia sets. The results obtained by analytical research are visualized using computer programs. The algorithms for constructing the Julia sets being considered are indicated.

In this paper the Alexandroff one point compactification of the 2-dimensional Khalimsky (K-, for brevity) plane (resp. the 1-dimensional Khalimsky line) is called the infinite K-sphere (resp. the infinite K-circle). The present paper initially proves that the infinite K-circle has the fixed point property (FPP, for short) in the set Con(Z*), where Con(Z*) means the set of all continuous self-maps f of the infinite K-circle. Next, we address the following query which remains open: Under what condition does the infinite K-sphere have the FPP? Regarding this issue, we prove that the infinite K-sphere has the FPP in the set Con*((Z2)*) (see Definition 1.1). Finally, we compare the FPP of the infinite K-sphere and that of the infinite M-sphere, where the infinite M-sphere means the one point compactification of the Marcus-Wyse topological plane.

The image formula of the incomplete H-functions is derived in this paper by using the Srivastava-Luo-Raina $\mathbb{M}$-Transform. Also, we obtained the image formulae of some useful and important cases of incomplete H-function. The results derived in this paper are in general form and several known and new results can be obtained by giving particular values to the parameters involved in the main results.

Very recently, the notion of graphical rectangular [Formula: see text]-metric spaces has been introduced, where the weight of the symmetric edges endowing the directed graph is defined in terms of the underlying metric. Due to its intimate relationship with the directed graphs, such spaces have a wide range of applications in science and engineering. In this paper, we rectify some errors that arose in the paper [Younis et al., A novel approach of graphical rectangular [Formula: see text]-metric spaces with an application to the vibrations of a vertical heavy hanging cable, J. Fixed Point Theory Appl. 21(1) (2019) 33]. We show that the main result of the paper described above can be modified, and we present the same in this note.

The main goal of this paper is to study algorithmic properties of countable linear orders by constructing effective presentations of these structures on the set of natural numbers. In 1991, C. Jockusch and R. Soare constructed a low linear order without computable presentations. Earlier, in 1989, R. Downey and M. Moses showed that each low discrete linear order has a computable copy. It is natural to ask for which order types of low presentations the existence of a computable presentation is sufficient. This question (namely, research program) was stated by R. Downey in 1998: Describe the order property P such that, for any low linear order L, P(L) implies the existence of a computable presentation of L. In this paper, we give a detailed review of the main results in this direction. These results are mostly obtained by the author or in co-authorship.

In the direction towards the question when mixed multiplicities are equal to the Hilbert-Samuel multiplicity of joint reductions, this paper not only generalizes [28, Theorem 3.1] that covers the Rees's theorem [13, Theorem 2.4], but also removes the hypothesis that joint reductions are systems of parameters in [28, Theorem 3.1]. The results of the paper seem to make the problem of expressing mixed multiplicities into the Hilbert-Samuel multiplicity of joint reductions become closer., 15 pages

We give a simplified and complete proof of the convergence of the chordal exploration process in critical FK–Ising percolation to chordal $$\mathrm {SLE}_\kappa ( \kappa -6)$$ with $$\kappa =16/3$$. Our proof follows the classical excursion construction of $$\mathrm {SLE}_\kappa (\kappa -6)$$ processes in the continuum, and we are thus led to introduce suitable cut-off stopping times in order to analyse the behaviour of the driving function of the discrete system when Dobrushin boundary condition collapses to a single point. Our proof is very different from that of Kemppainen and Smirnov (Conformal invariance of boundary touching loops of FK–Ising model. arXiv:1509.08858, 2015; Conformal invariance in random cluster models. II. Full scaling limit as a branching SLE. arXiv:1609.08527, 2016) as it only relies on the convergence to the chordal $$\mathrm {SLE}_{\kappa }$$ process in Dobrushin boundary condition and does not require the introduction of a new observable. Still, it relies crucially on several ingredients: One important emphasis of this paper is to carefully write down some properties which are often considered folklore in the literature but which are only justified so far by hand-waving arguments. The main examples of these are: We end the paper with a detailed sketch of the convergence to radial $$\mathrm {SLE}_\kappa ( \kappa -6)$$ when $$\kappa =16/3$$ as well as the derivation of Onsager’s one-arm exponent 1 / 8.

In an earlier paper, we have given a definition of the Rockafellar integration function associated to a cyclically monotone mapping considering only systems of distinct elements in its domain. Thus, this function can be proper for certain non-cyclically monotone mappings. In this paper we establish general properties of Rockafellar function if the graph of mapping does not contain finite set of accumulation elements where the mapping is not cyclically monotone. Also, some dual properties are given.

We prove a new effective Chebotarev density theorem for Galois extensions $L/\mathbb{Q}$ that allows one to count small primes (even as small as an arbitrarily small power of the discriminant of $L$); this theorem holds for the Galois closures of "almost all" number fields that lie in an appropriate family of field extensions. Previously, applying Chebotarev in such small ranges required assuming the Generalized Riemann Hypothesis. The error term in this new Chebotarev density theorem also avoids the effect of an exceptional zero of the Dedekind zeta function of $L$, without assuming GRH. We give many different "appropriate families," including families of arbitrarily large degree. To do this, we first prove a new effective Chebotarev density theorem that requires a zero-free region of the Dedekind zeta function. Then we prove that almost all number fields in our families yield such a zero-free region. The innovation that allows us to achieve this is a delicate new method for controlling zeroes of certain families of non-cuspidal $L$-functions. This builds on, and greatly generalizes the applicability of, work of Kowalski and Michel on the average density of zeroes of a family of cuspidal $L$-functions. A surprising feature of this new method, which we expect will have independent interest, is that we control the number of zeroes in the family of $L$-functions by bounding the number of certain associated fields with fixed discriminant. As an application of the new Chebotarev density theorem, we prove the first nontrivial upper bounds for $\ell$-torsion in class groups, for all integers $\ell \geq 1$, applicable to infinite families of fields of arbitrarily large degree., Comment: 52 pages. This shorter version aligns with the published paper. Note that portions of Section 8 of the longer v1 have been developed as a separate paper with identifier arXiv:1902.02008

In a previous paper (Funct. Anal. Appl., 3 (2015), 205–209), we defined quantum Markov states. Here we recall this definition and present a proof of the results from that paper (which are given there without proofs). We give a definition of a quantum hidden Markov state generated by a function of a quantum Markov process and show how it is related to other definitions of such states. Our definitions work for quantum Markov fields on ℤN and on graphs. We consider an example with the Cayley tree.

In this paper we study the set of digit frequencies that are realised by elements of the set of $$\beta $$ -expansions. The main result of this paper demonstrates that as $$\beta $$ approaches 1, the set of digit frequencies that occur amongst the set of $$\beta $$ -expansions fills out the simplex. As an application of our main result, we obtain upper bounds for the local dimension of certain biased Bernoulli convolutions.

In the paper we describe a new propositional encoding procedure for the property that all objects comprising some finite set are distinct. For the considered class of combinatorial problems it is sufficient to represent the elements of such set by their natural numbers. Thus, there is a problem of constructing a satisfiable Boolean formula, the satisfying assignments of which encode the first $n$ natural numbers without taking into account their order. The necessity to encode such sets into Boolean logic is motivated by the desire to apply to the corresponding combinatorial problems the state-of-the-art algorithms for solving the Boolean satisfiability problem (SAT). In the paper we propose the new approach to defining the Boolean formula for the characteristic function of the predicate which takes the value of True only on the sets of binary words encoding the numbers from 0 to $n-1$. The corresponding predicate was named OtO (from One-to-One). The propositional encoding of the OtO-predicate has a better lower bound compared to the propositional encoding of a relatively similar predicate known as OOC-predicate (from Only One Cardinality). The proposed OtO-predicate is used to reduce to SAT a number of problems related to Latin squares. In particular, using the OtO-predicate we constructed the SAT encodings for the problems of finding orthogonal pairs and quasi-orthogonal triples of Latin squares of order 10. We used the multi-threaded SAT solvers and the resources of a computing cluster to solve these problems.

This paper considers two variants of M/G/1 queues with impatient customers, which are denoted by M/G/1+Gw and M/G/1+Gs. In the M/G/1+Gw queue customers have deadlines for their waiting times, and they leave the system immediately if their services do not start before the expiration of their deadlines. On the other hand, in the M/G/1+Gs queue customers have deadlines for their sojourn times, where customers in service also immediately leave the system when their deadlines expire. In this paper we derive comparison results for performance measures of these models. In particular, we show that if the service time distribution is new better than used in expectation, then the loss probability in the M/G/1+Gs queue is greater than that in the M/G/1+Gw queue.

The present paper introduces new classes of Stancu–Kantorovich operators constructed in the King sense. For these classes of operators, we establish some convergence results, error estimations theorems and graphical properties of approximation for the classes considered, namely, operators that preserve the test functions e0(x)=1 and e1(x)=x, e0(x)=1 and e2(x)=x2, as well as e1(x)=x and e2(x)=x2. The class of operators that preserve the test functions e1(x)=x and e2(x)=x2 is a genuine generalization of the class introduced by Indrea et al. in their paper “A New Class of Kantorovich-Type Operators”, published in Constr. Math. Anal.

Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself as a powerful technique for looking for (cocyclic) Hadamard matrices. Ten years later, the series of papers by Kotsireas, Koukouvinos and Seberry about Hadamard matrices with one or two circulant cores introduced a different structured approach to the Hadamard conjecture. This paper is built on both strengths, so that Hadamard matrices with cocyclic cores are introduced and studied. They are proved to strictly include usual Hadamard matrices with one and two circulant cores, and therefore provide a wiser uniform approach to a structured Hadamard conjecture. Junta de Andalucía FQM-016

Let FolR(2, d) be the space of real algebraic foliations of degree d in RP(2). For fixed d, let IntR(2, d) = {F 2 FolR(2, d) | F has a non-constant rational first integral}. Given F 2 IntR(2, d), with primitive first integral G, set O(F) = number of real ovals of the generic level (G = c). Let O(d) = sup{O(F) | F 2 IntR(2, d)}. The main purpose of this paper is to prove that O(d) = +1 for all d _ 5., Let FolR(2, d) be the space of real algebraic foliations of degree d in RP(2). For fixed d, let IntR(2, d) = {F € FolR (2, d) | F has non-constant rational first integral}. Given F € IntR(2, d), with primitive first integral G, set O(F) = number of real ovals of thegeneric level (G = c). Let O(d) = sup{O(F) | F € IntR(2, d)}.The main purpose of this paper is to prove that O(d) = +∞ for all d ≥ 5.

It is conjectured that within the class group of any number field, for every integer $\ell \geq 1$, the $\ell$-torsion subgroup is very small (in an appropriate sense, relative to the discriminant of the field). In nearly all settings, the full strength of this conjecture remains open, and even partial progress is limited. Significant recent progress toward average versions of the $\ell$-torsion conjecture has crucially relied on counts for number fields, raising interest in how these two types of question relate. In this paper we make explicit the quantitative relationships between the $\ell$-torsion conjecture and other well-known conjectures: the Cohen-Lenstra heuristics, counts for number fields of fixed discriminant, counts for number fields of bounded discriminant (or related invariants), and counts for elliptic curves with fixed conductor. All of these considerations reinforce that we expect the $\ell$-torsion conjecture is true, despite limited progress toward it. Our perspective focuses on the relation between pointwise bounds, averages, and higher moments, and demonstrates the broad utility of the "method of moments.", The paper arXiv:1709.09637v1 by the same authors was submitted for publication in a significantly shorter version; some of the excluded material appears in this new paper, which also proves further results. Version 2 updates some references, with corresponding improvements in Section 6. Version 3 has a few small changes to streamline exposition after referee process

In this present paper, we introduce the idea and concept of n-polynomial s-type preinvex functions. We elaborate and investigate the algebraic properties of the newly introduced definition and discuss their connections and relations with convex functions. We find the new sort of Hermite-Hadamard inequality via a newly introduced definition. Furthermore, some refinements of Hermite-Hadamard inequality are given. Finally, we investigated some applications via this newly introduced definition. The results obtained in this paper can be viewed as significant improvement of previously known results. H.E.C. Pakistan under NRPU project [7906] The research of the author Saad Ihsan Butt has been fully supported by H.E.C. Pakistan under NRPU project 7906. WOS:000649589100001 2-s2.0-85105631491

This work is dedicated to APN and AB functions which are optimal against differential and linear cryptanlysis when used as Sboxes in block ciphers. They also have numerous applications in other branches of mathematics and information theory such as coding theory, sequence design, combinatorics, algebra and projective geometry. In this paper we give an overview of known constructions of APN and AB functions, in particular, those leading to infinite classes of these functions. Among them, the bivariate construction method, the idea first introduced in 2011 by the third author of the present paper, turned out to be one of the most fruitful. It has been known since 2011 that one of the families derived from the bivariate construction contains the infinite families derived by Dillon’s hexanomial method. Whether the former family is larger than the ones it contains has stayed an open problem which we solve in this paper. Further we consider the general bivariate construction from 2013 by the third author and study its relation to the recently found infinite families of bivariate APN functions.

The so called Landis conjecture states that if a solution of the equation $$\Delta u+V(x)u=0$$ in an exterior domain decays faster than $e^{-\kappa|x|}$, for some $\kappa>\sqrt{\sup |V|}$, then it must be identically equal to $0$. This property can be viewed as a unique continuation at infinity (UCI) for solutions satisfying a suitable exponential decay. The Landis conjecture was disproved by Meshkov in the case of complex-valued functions, but it remained open in the real case. In the 2000s, several papers have addressed the issue of the UCI for linear elliptic operators with real coefficients. The results that have been obtained require some kind of sign condition, either on the solution or on the zero order coefficient of the equation. The Landis conjecture is still open nowadays in its general form. In the present paper, we start with considering a general (real) elliptic operator in dimension $1$. We derive the UCI property with a rate of decay $\kappa$ which is sharp when the coefficients of the operator are constant. In particular, we prove the Landis conjecture in dimension $1$, and we can actually reach the threshold value $\kappa=\sqrt{\sup |V|}$. Next, we derive the UCI property -- and then the Landis conjecture -- for radial operators in arbitrary dimension. Finally, with a different approach, we prove the same result for positive supersolutions of general elliptic equations.

We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs without dense spots. In doing so, we replace the no dense spots hypothesis with weaker assumptions, which allow us to analyze graphs with power law degree distributions. This gives the first broadly applicable limit theory for sparse graphs with unbounded average degrees. In this paper, we lay the foundations of the $L^p$ theory of graphons, characterize convergence, and develop corresponding random graph models, while we prove the equivalence of several alternative metrics in a companion paper., Comment: 44 pages

In this paper, we prove normality criteria for families of meromorphic functions involving sharing of a holomorphic function by a certain class of differential polynomials. Results in this paper extend the works of different authors carried out in recent years, for example Charak and Sharma (Turk J Math 41: 404–411, 2017), Fang and Yuan (J Aust Math Soc Ser A 68(3): 321–333, 2000) Jiang and Gao (Acta Math Sci 32(4): 1503–1512, 2012), Meng and Hu (Bull Malays Math Sci Soc 38:1331–1347, 2015), Sun (Kragujev J Math 38(2):273–282, 2014), Xiao et al. (Abstr Appl Anal Article ID 373910, 1–8, 2011), Yuan (Arch Math 96(5): 435–444 2011).

The Hermite–Hadamard inequality was extended using iterated integrals by Retkes [Acta Sci Math (Szeged) 74:95–106, 2008]. In this paper we further extend the main results of the above paper for convex and also for s-convex functions in the second sense.

In this paper we determine the largest sets of points of finite thick buildings of type F4 such that no two points of the set are at maximal distance. The motivation for studying these sets comes from [9], where a general Erdős–Ko–Rado problem was formulated for finite thick buildings. The result in this paper solves this problem for points (and dually for symplecta) in finite thick buildings of type F4.

In a previous paper [1], I described a method for computing sums of powers via a matrix composed from Pascal's triangle. (The motivation for this came from a mathematical puzzle posed by Paul Maslanka in the Guardian.) Since then I have read or viewed a number of papers on sums of powers. Some were nearly four hundred years old and the most recent one was published this year. One rather obscure work I stumbled across was ‘On the sums of powers of natural numbers’ by the Japanese mathematician Mr T. Kariya, published in Tokyo in 1907. If any readers know more of Mr Kariya I would be glad to hear about him.

In this paper we introduce a natural model for the realization space of a polytope up to projective equivalence which we call the slack realization space of the polytope. The model arises from the positive part of an algebraic variety determined by the slack ideal of the polytope. This is a saturated determinantal ideal that encodes the combinatorics of the polytope. We also derive a new model of the realization space of a polytope from the positive part of the variety of a related ideal. The slack ideal offers an effective computational framework for several classical questions about polytopes such as rational realizability, non-prescribability of faces, and realizability of combinatorial polytopes., Comment: The original arXiv submission of this paper has now been split into two parts; this paper describing the slack realization space of a polytope and applications of the slack ideal, and a second paper focussing on toric slack ideals and projective uniqueness

The present paper studies certain low-level separation axioms of a topological space, denoted by A(X), induced by a geometric AC-complex X. After proving that whereas A(X) is an Alexandroff space satisfying the semi-T1 2 -separation axiom, we observe that it does neither satisfy the pre T1 2 -separation axiom nor is a Hausdorff space. These are main motivations of the present work. Although not every A(X) is a semi-T1 space, after proceeding with an edge to edge tiling (or a face to face crystallization) of Rn, n ? N, denoted by T(Rn) as an AC complex, we prove that A(T(Rn)) is a semi-T1 space. Furthermore, we prove that A(En), induced by an nD Cartesian AC complex Cn = (En,N,dim), is also a semi-T1 space, n ? N. The paper deals with AC-complexes with the locally finite (LF-, for brevity) property, which can be used in the fields of pure and applied mathematics as well as digital topology, computational topology, and digital geometry.

Kavut, Selçuk (Balikesir Author), Very recently, a class of cryptographically significant Boolean functions were constructed by Tang and Maitra [IEEE Trans. Inform. Theory, 64 ( 2018), pp. 393-402] by modifying the PSap class of bent functions. The basic ideas used in Tang-Maitra construction were derived from a modification of a subclass of bent functions which is defined over the finite field, and a concern was raised in the same paper whether the implementation of such functions will be as efficient as that of Maiorana-McFarland type bent functions. In this paper, we look at the concrete realization of such functions over a vector space and answer the question positively. The first part of this paper investigates how the finite field implementation of the functions can be viewed as simple truth tables. Next, we present a completely new construction that itself starts from Maiorana-McFarland bent functions which are straightforward concatenations of linear functions., National Natural Science Foundation of China - 61872435 61602394 Fundamental Research Funds for the Central Universities - 2682016CX113 2682018ZT25

Two permutations of $[n]=\{1,2 \ldots n\}$ are \textit{$k$-neighbor separated} if there are two elements that are neighbors in one of the permutations and that are separated by exactly $k-2$ other elements in the other permutation. Let the maximal number of pairwise $k$-neighbor separated permutations of $[n]$ be denoted by $P(n,k)$. In a previous paper, the authors have determined $P(n,3)$ for every $n$, answering a question of K\"orner, Messuti and Simonyi affirmatively. In this paper we prove that for every fixed positive integer $\ell $, $$P(n,2^\ell+1) = 2^{n-o(n)}. $$ We conjecture that for every fixed even $k$, $P(n,k)=2^{n-o(n)}$. We also show that this conjecture is asymptotically true in the following sense $$\lim_{k \rightarrow \infty} \lim_{n \rightarrow \infty} \sqrt[n]{P(n,k)}=2.$$ Finally, we show that for even $n$, $P(n,n)= 3n/2$.

In this paper, we obtain three intersection theorems that can be considered versions of Theorem 3.1 from the paper [Agarwal, R. P., Balaj, M. and O’Regan, D., Intersection theorems with applications in optimization, J. Optim. Theory Appl., 179 (2018), 761–777]. As will be seen, there are two major differences between the hypotheses of the above mentioned theorem and those of our results. Applications of the main results are considered in the last two sections of the paper.

A $(\beta,\epsilon)$-hopset for a weighted undirected $n$-vertex graph $G=(V,E)$ is a set of edges, whose addition to the graph guarantees that every pair of vertices has a path between them that contains at most $\beta$ edges, whose length is within $1+\epsilon$ of the shortest path. In her seminal paper, Cohen \cite[JACM 2000]{C00} introduced the notion of hopsets in the context of parallel computation of approximate shortest paths, and since then it has found numerous applications in various other settings, such as dynamic graph algorithms, distributed computing, and the streaming model. Cohen \cite{C00} devised efficient algorithms for constructing hopsets with {\em polylogarithmic} in $n$ number of hops. Her constructions remain the state-of-the--art since the publication of her paper in STOC'94, i.e., for more than two decades. In this paper we exhibit the first construction of sparse hopsets with a {\em constant number of hops}. We also find efficient algorithms for hopsets in various computational settings, improving the best known constructions. Generally, our hopsets strictly outperform the hopsets of \cite{C00}, both in terms of their parameters, and in terms of the resources required to construct them. We demonstrate the applicability of our results for the fundamental problem of computing approximate shortest paths from $s$ sources. Our results improve the running time for this problem in the parallel, distributed and streaming models, for a vast range of $s$.

In this paper, we introduce some new notions such as interval valued neutrosophic soft points, interval valued neutrosophic soft mappings, interval valued neutrosophic soft Hausdorff topological spaces, and interval valued neutrosophic soft compact topological spaces. Cantor?s intersection theorem is proved for interval valued neutrosophic soft sets. The aim of this paper is to establish the existence of fixed points of interval valued neutrosophic soft mappings on interval valued neutrosophic soft compact topological spaces. Some examples are provided to support the concepts and the results presented herein.

Let k be a field of characteristic $$ p\not =0 $$. For a (purely) inseparable extension K / k the notion of modularity, defined by M.E. Sweedler in the 60s, is a very important property, very much like being Galois for a separable extension. We have defined, together with M. Chellali, a generalization of the notion of modularity, called lower quasi-modularity: K / k is lower quasi-modular (lq-modular) if for some finite extension $$k'$$ over k we have that $$K/k'$$ is modular. In subsequent papers M. Chellali and the author have studied various properties of lq-modular field extensions, including the existence of lq-modular closures in case $$[k{:}k^p]$$ is finite. In this paper we prove a similar result, without the hypothesis on k but with extra assumptions on K / k: the extension needs to be q-finite, that is, there must exist an integer M such that for every positive integer n the field $$K\cap k^{p^{-n}}$$ is generated by at most M elements on k. A number of properties of lq-modular closures are determined and examples are presented illustrating the results.

The main goal of this paper is to give a deeper understanding of the geometrical inequality proposed by Martin Lukarevski in [1]. In order to formulate our results we shall introduce and use the following notation throughout this paper. Let A1A2A3 be a triangle a1, a2, a3, the lengths of the sides opposite to A1, A2, A3 respectively, P an arbitrary inner point of it xi, the distance of P from the side of length ai. Let r, R be the inradius and circumradius of the triangle hi, the altitude belonging to side ai, Δ the area and finally let α be a real parameter. We adopt also the use of Σui to refer the sum taken over the suffices i = 1, 2, 3. Now we are in the position to reformulate the original problem into a more general form namely: find bounds for Σxαi in terms of r and R. The main results of our investigation are summarised in the following theorem.

The main purpose of this paper is to explore the structure of local and regular Dirichlet forms associated with symmetric one-dimensional diffusions, which are also called symmetric linear diffusions. Let ( E , F ) (\mathcal {E},\mathcal {F}) be a regular and local Dirichlet form on L 2 ( I , m ) L^2(I,m) , where I I is an interval and m m is a fully supported Radon measure on I I . We shall first present a complete representation for ( E , F ) (\mathcal {E},\mathcal {F}) , which shows that ( E , F ) (\mathcal {E},\mathcal {F}) lives on at most countable disjoint “effective" intervals with an “adapted" scale function on each interval, and any point outside these intervals is a trap of the one-dimensional diffusion. Furthermore, we shall give a necessary and sufficient condition for C c ∞ ( I ) C_c^\infty (I) being a special standard core of ( E , F ) (\mathcal {E},\mathcal {F}) and shall identify the closure of C c ∞ ( I ) C_c^\infty (I) in ( E , F ) (\mathcal {E},\mathcal {F}) when C c ∞ ( I ) C_c^\infty (I) is contained but not necessarily dense in F \mathcal {F} relative to the E 1 1 / 2 \mathcal {E}_1^{1/2} -norm. This paper is partly motivated by a result of Hamza’s that was stated in a theorem of Fukushima, Oshima, and Takeda’s and that provides a different point of view to this theorem. To illustrate our results, many examples are provided.

In this paper, we establish coincidence point and common fixed point theorems involving two pairs of weakly compatible mapping satisfying contraction condition with complex coefficient are proved in complex valued metric space. The presented theorems generalize, extend and improve many existing results in the literature. An example is given at the end of the paper.

Scientific problems often feature observational data received in the form $$w_1=l_1(f),\ldots $$ , $$w_m=l_m(f)$$ of known linear functionals applied to an unknown function f from some Banach space $$\mathcal {X}$$ , and it is required to either approximate f (the full approximation problem) or to estimate a quantity of interest Q(f). In typical examples, the quantities of interest can be the maximum/minimum of f or some averaged quantity such as the integral of f, while the observational data consists of point evaluations. To obtain meaningful results about such problems, it is necessary to possess additional information about f, usually as an assumption that f belongs to a certain model class $$\mathcal {K}$$ contained in $$\mathcal {X}$$ . This is precisely the framework of optimal recovery, which produced substantial investigations when the model class is a ball in a smoothness space, e.g., when it is a unit ball in Lipschitz, Sobolev, or Besov spaces. This paper is concerned with other model classes described by approximation processes, as studied in DeVore et al. [Data assimilation in Banach spaces, (To Appear)]. Its main contributions are: (1) designing implementable optimal or near-optimal algorithms for the estimation of quantities of interest, (2) constructing linear optimal or near-optimal algorithms for the full approximation of an unknown function using its point evaluations. While the existence of linear optimal algorithms for the approximation of linear functionals Q(f) is a classical result established by Smolyak, a numerically friendly procedure that performs this approximation is not generally available. In this paper, we show that in classical recovery settings, such linear optimal algorithms can be produced by constrained minimization methods. We illustrate these techniques on several examples involving the computation of integrals using point evaluation data. In addition, we show that linearization of optimal algorithms can be achieved for the full approximation problem in the important situation where the $$l_j$$ are point evaluations and $$\mathcal {X}$$ is a space of continuous functions equipped with the uniform norm. It is also revealed how quasi-interpolation theory enables the construction of linear near-optimal algorithms for the recovery of the underlying function.

During the last few decades, domination theory has been one of the most active areas of research within graph theory. Currently, there are more than 4400 published papers on domination and related parameters. In the case of total domination, there are over 580 published papers, and 50 of them concern the case of product graphs. However, none of these papers discusses the case of rooted product graphs. Precisely, the present paper covers this gap in the theory. Our goal is to provide closed formulas for the total domination number of rooted product graphs. In particular, we show that there are four possible expressions for the total domination number of a rooted product graph, and we characterize the graphs reaching these expressions.

In 2006, A. Stakhov introduced a new coding/decoding process based on generating matrices of the Fibonacci p-numbers, which he called the Fibonacci coding/decoding method. Stakhov&rsquo, s papers have motivated many other scientists to seek certain generalizations by introducing new additional coefficients into recurrence of Fibonacci p-numbers. In 2013, I. Włoch et al. studied (2,q)-distance Fibonacci numbers F2(q,n) and found some of their combinatorial properties. In this paper, we state a new coding theory based on the sequence (Tq(n))n=&minus, &infin, which is an extension of Włoch&rsquo, s sequence (F2(q,n))n=0&infin

In this paper, we study some optimal inequalities of the Riccati type and of the Bihari type. We also consider nonoptimal inequalities of the Wendorf type. At the same time, we get a partial answer to Problems 5 and 9, formulated by I. A. Rus. This paper is also motivated by the fact that, in many inequalities, the upper bound is not an optimal one.

Let Ckn,l be a simple closed k-curves with l elements in Zn and W:=Ckn,l&or, ⋯&or, Ckn,l︷m-times be an m-iterated digital wedges of Ckn,l, and F(Conk(W)) be an alignment of fixed point sets of W. Then, the aim of the paper is devoted to investigating various properties of F(Conk(W)). Furthermore, when proceeding with this work, this paper addresses several unsolved problems. To be specific, we firstly formulate an alignment of fixed point sets of Ckn,l, denoted by F(Conk(Ckn,l)), where l(&ge, 7) is an odd natural number and k&ne, 2n. Secondly, given a digital image (X,k) with X♯=n, we find a certain condition that supports n&minus, 1,n&minus, 2&isin, F(Conk(X)). Thirdly, after finding some features of F(Conk(W)), we develop a method of making F(Conk(W)) perfect according to the (even or odd) number l of Ckn,l. Finally, we prove that the perfectness of F(Conk(W)) is equivalent to that of F(Conk(Ckn,l)). This can play an important role in studying fixed point theory and digital curve theory. This paper only deals with k-connected digital images (X,k) such that X♯&ge, 2.

The present work is the first member of a pair of papers concerning decreasingly-minimal (dec-min) elements of a set of integral vectors, where a vector is dec-min if its largest component is as small as possible, within this, the next largest component is as small as possible, and so on. This discrete notion, along with its fractional counterpart, showed up earlier in the literature under various names. The domain we consider is an M-convex set, that is, the set of integral elements of an integral base-polyhedron. A fundamental difference between the fractional and the discrete case is that a base-polyhedron has always a unique dec-min element, while the set of dec-min elements of an M-convex set admits a rich structure, described here with the help of a "canonical chain". As a consequence, we prove that this set arises from a matroid by translating the characteristic vectors of its bases with an integral vector. By relying on these characterizations, we prove that an element is dec-min if and only if the square-sum of its components is minimum, a property resulting in a new type of min-max theorems. The characterizations also give rise, as shown in the companion paper, to a strongly polynomial algorithm, and to several applications in the areas of resource allocation, network flow, matroid, and graph orientation problems, which actually provided a major motivation to the present investigations. In particular, we prove a conjecture on graph orientation., 39 pages This is a revised version of the first half of "A. Frank and K. Murota; Discrete decreasing minimization, PartI: Base-polyhedra with applications in network optimization" arXiv:1808.07600

The paper presents the Triads Geometric Consistency Index ( T − G C I ), a measure for evaluating the inconsistency of the pairwise comparison matrices employed in the Analytic Hierarchy Process (AHP). Based on the Saaty’s definition of consistency for AHP, the new measure works directly with triads of the initial judgements, without having to previously calculate the priority vector, and therefore is valid for any prioritisation procedure used in AHP. The T − G C I is an intuitive indicator defined as the average of the log quadratic deviations from the unit of the intensities of all the cycles of length three. Its value coincides with that of the Geometric Consistency Index ( G C I ) and this allows the utilisation of the inconsistency thresholds as well as the properties of the G C I when using the T − G C I . In addition, the decision tools developed for the G C I can be used when working with triads ( T − G C I ), especially the procedure for improving the inconsistency and the consistency stability intervals of the judgements used in group decision making. The paper further includes a study of the computational complexity of both measures ( T − G C I and G C I ) which allows selecting the most appropriate expression, depending on the size of the matrix. Finally, it is proved that the generalisation of the proposed measure to cycles of any length coincides with the T − G C I . It is not therefore necessary to consider cycles of length greater than three, as they are more complex to obtain and the calculation of their associated measure is more difficult.

Systems working in discrete time (discrete event systems, in short: DES)—based on binary operations: the maximum and the minimum—are studied in so-called max–min (fuzzy) algebra. The steady states of a DES correspond to eigenvectors of its transition matrix. In reality, the matrix (vector) entries are usually not exact numbers and they can instead be considered as values in some intervals. The aim of this paper is to investigate the eigenvectors for max–min matrices (vectors) with interval coefficients. This topic is closely related to the research of fuzzy DES in which the entries of state vectors and transition matrices are kept between 0 and 1, in order to describe uncertain and vague values. Such approach has many various applications, especially for decision-making support in biomedical research. On the other side, the interval data obtained as a result of impreciseness, or data errors, play important role in practise, and allow to model similar concepts. The interval approach in this paper is applied in combination with forall–exists quantification of the values. It is assumed that the set of indices is divided into two disjoint subsets: the E-indices correspond to those components of a DES, in which the existence of one entry in the assigned interval is only required, while the A-indices correspond to the universal quantifier, where all entries in the corresponding interval must be considered. In this paper, the properties of EA/AE-interval eigenvectors have been studied and characterized by equivalent conditions. Furthermore, numerical recognition algorithms working in polynomial time have been described. Finally, the results are illustrated by numerical examples.

In this paper, we introduce a new construction method of a fuzzy implication from n increasing functions gi:0,1⟶0,&infin, (g0=0) (i=1,2,&hellip, n, n &isin, N) and n+1 fuzzy negations Ni (i=1,2,&hellip, n+1, n &isin, N). Imagine that there are plenty of combinations between n increasing functions gi and n+1 fuzzy negations Ni in order to produce new fuzzy implications. This method allows us to use at least two fuzzy negations Ni and one increasing function g in order to generate a new fuzzy implication. Choosing the appropriate negations, we can prove that some basic properties such as the exchange principle (EP), the ordering property (OP), and the law of contraposition with respect to N are satisfied. The worth of generating new implications is valuable in the sciences such as artificial intelligence and robotics. In this paper, we have found a novel method of generating families of implications. Therefore, we would like to believe that we have added to the literature one more source from which we could choose the most appropriate implication concerning a specific application. It should be emphasized that this production is based on a generalization of an important form of Yager&rsquo, s implications.

The norm of a partition is defined as the product of its parts. This paper aims to conduct a thorough study of norms of prime partitions which are partitions with all prime parts. The analysis begins by defining r p ( i , n ) , called the primal norm counting function, which refers to number of times i appears as a norm to the prime partitions of n. The generating function for this function is deduced, using which a wealth of intriguing relations are proved like series, product, integral representations, and recursive relations, etc. The special cases of these results bear resemblance to other results known in classical partition theory. An analogue of the Goldbach conjecture in the theory of norms is presented, and it is stressed that an explicit formula for r p ( i , n ) must be extracted. Two approaches are discussed for this purpose, and the paper is concluded with a potential scope for future work.