Search

Propositions 1.1–1.3 stated below contribute to results and certain problems considered in [E-S], on the behavior of products $$\Pi^n_1(1-z^{a_j}),1\leq{a_1}...\leq{a_n}$$ integers. In the discussion below, {a1,..., an} will be either a proportional subset of {1,..., n} or a set of large arithmetic diameter.

We correct a mistake in a lemma in the paper cited in the title and show that it did not affect any of the other results of the paper. To this end, we prove results on linearly disjoint field extensions that do not seem to be commonly known. We give an example to show that a separability assumption in one of these results cannot be dropped (doing so had led to the mistake). Further, we discuss recent generalizations of the original classification of defect extensions.

In this short note, we show that Theorem 4.3 of Liu and Yu (Monatshefte Math 195:173–176, 2021) is a consequence of Lemma 2 of Ballester-Bolinches and Esteban-Romero (J Aust Math Soc 75:181–191, 2003).

We correct an error in the paper of Z. Shen, S. Li, and J. Zhang published in [4]. In addition, we give an answer to a question posed by the authors.

For any discrete valuation ring R, any R-linear mapping u from an R-module E into an R-module F and any \(y_0\in F\), a necessary and sufficient condition for the solvability of the equation \(u(x)=y_0\) is established, and an application of this result is presented.

We characterize functions of finite energy in the plane in terms of their traces on the lines that make up "graph paper" with squares of side length $mn$ for all $n$, and certain $\12-$order Sobolev norms on the graph paper lines. We also obtain analogous results for functions of finite energy on two classical fractals: the Sierpinski gasket and the Sierpinski carpet.

The abstract results and applications presented in “Controllability of fractional neutral stochastic functional differential systems, Z. Angew. Math. Phys. 65 (2014), no. 5, 941–959, are not correct. Moreover, the class of differential control problems studied in [1] is not H-controllable.

The spectral gap conjecture of M. van den Berg [2, formula (65)] asserts that λ2 − λ1 ≥ 3π for all convex euclidean domains of diameter 1, where λ1 and λ2 denote the first two eigenvalues of the Dirichlet Laplacian. Notice that equality holds for the 1-dimensional unit interval, which can be regarded also as a degenerate n-dimensional rectangular box. The gap estimate is conjectured to hold more generally for Schrodinger operators with convex potentials, under Dirichlet boundary conditions; see the work of S.-T. Yau and collaborators [9, 11]. This Schrodinger gap conjecture was proved some time ago in 1 dimension by R. Lavine [8], and more recently in all dimensions by B. Andrews and J. Clutterbuck [1]. The proof in this journal by H. Donnelly [3] of the original gap conjecture in 2 dimensions (for the Dirichlet Laplacian with zero potential) is not correct. The Editors of Mathematische Zeitschrift have asked us to describe the flaws in the proof, in order to clarify the state of the literature. Donnelly’s approach to the problem is a natural one: first perform a shape optimization to rule out a non-degenerate minimizing domain, and then analyze the spectral gap for a sequence of domains degenerating to an interval, with the help of results by D. Jerison [5]. (For some history on this approach, and on the gap conjecture more generally, see the report on the AIM meeting “Low Eigenvalues of Laplace and Schrodinger Operators” [10], especially page 12 of the open problems list.) The error lies in the proof of the shape optimization step, as we now explain. Donnelly wishes to prove that no minimizing domain can exist for

It is pointed out that the proof of the basic result of Rahmanov's paper has a serious gap. It is documented by original sources that a statement he relied on in the proof contains a misprint, and it is shown by a counterexample that this statement (with the misprint) is, in fact, false. A somewhat weaker statement is proved true.

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive semidefinite rank of an associated matrix. We then study optimization over the set of synchronous correlations by investigating quantum graph parameters. We unify existing bounds on the quantum chromatic number and the quantum stability number by placing them in the framework of tracial optimization. In particular, we show that the projective packing number, the projective rank, and the tracial rank arise naturally when considering tracial analogues of the Lasserre hierarchy for the stability and chromatic number of a graph. We also introduce semidefinite programming hierarchies converging to the commuting quantum chromatic number and commuting quantum stability number., Comment: 26 pages

In this short paper, we consider the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of two squares of primes and a k-th power of prime for any integer $$k \ge 3$$ . Our results improve the recent results due to Brudern (in: Sander, Steuding, Steuding (eds) From arithmetic to zeta-functions, Springer, Cham 2016). The similar method can be also applied to some related questions in this direction, and this can improve the previous results.

Let I be the Stanley–Reisner ideal of a simplicial complex Δ. In this short paper, we shall give a formula of vanishing of the local cohomology modules for S/I(r) in the case Δ is a union of disjoint matroids, where I(r) is the rth symbolic power of I. As an application, we will improve a previous result in Minh and Nakamura (Nagoya Math. J. 213, 127–140, 2014) for the k-Buchsbaumness of S/I(r).

0.1. How it all began. When the second author translated a result on algebraic sur faces into the language of lattice polygons using toric geometry, he got a simple inequality for lattice polygons. This inequality had originally been discovered by Scott [12]. The first author then found a third proof. Subsequently, both authors went through a phase of polygon addiction. Once you get started drawing lattice polygons on graph paper and discovering relations between their numerical invariants, it is not so easy to stop! (The gentle reader has been warned.) Thus, it was just unavoidable that the authors came up with new inequalities: Scott's inequality can be sharpened if one takes into account another invariant, which is de fined by peeling off the skins of the polygons like an onion (see Section 3).

This paper studies the virtual $\chi_{-y}$-genera of Grothendieck's Quot schemes on surfaces, thus refining the calculations of the virtual Euler characteristics by Oprea-Pandharipande. We first prove a structural result expressing the equivariant virtual $\chi_{-y}$-genera of Quot schemes universally in terms of the Seiberg-Witten invariants. The formula is simpler for curve classes of Seiberg-Witten length $N$, which are defined in the paper. By way of application, we give complete answers in the following cases: (i) arbitrary surfaces for the zero curve class, (ii) relatively minimal elliptic surfaces for rational multiples of the fiber class, (iii) minimal surfaces of general type with $p_g>0$ for any curve classes. Furthermore, a blow up formula is obtained for curve classes of Seiberg-Witten length $N$. As a result of these calculations, we prove that the generating series of the virtual $\chi_{-y}$-genera are given by rational functions for all surfaces with $p_g>0$, addressing a conjecture of Oprea-Pandharipande. In addition, we study the reduced $\chi_{-y}$-genera for $K3$ surfaces and primitive curve classes with connections to the Kawai-Yoshioka formula., Comment: 48 pages. Reformulation of Theorem 1 for readability. Extra explanation for the mixed terms in section 2.2.3. Reference updates

In Li et al. (J Aust Math Soc 97:383–390, 2014), the authors discussed two classes of mappings in Banach spaces, which are $$\varphi $$ -quasiisometric mappings in the distance ratio metric (briefly, $$\varphi $$ -DRQI mappings) and fully $$\varphi $$ -quasiisometric mappings in the distance ratio metric (briefly, $$\varphi $$ -FDRQI mappings), where $$\varphi :$$ $$[0,\infty )\rightarrow [0,\infty )$$ denotes a quasiisometric control function. In this paper, we continue this discussion by introducing a new class of mappings, that is, $$\varphi $$ -PDRQI mappings. The purpose of this paper is twofold. Let f be a homeomorphism between two proper domains in a Banach space. First, we prove that f being $$\varphi $$ -PDRQI is equivalent to f being $$\varphi $$ -FDRQI. Then, as an application of the obtained equivalent relation, we show that f being $$\varphi $$ -DRQI, f being $$\varphi $$ -PDRQI and f being $$\varphi $$ -FDRQI are equivalent to each other when the quasiisometric control functions have the form $$\varphi (t)=Mt$$ .

Since the appearance of Robbins’s paper (1948) the central limit theorem for a sum of a random number of independent identically distributed random variables is one of the most fundamental results in probability, and explains the appearance of the normal distribution in a whole host of diverse applications in mathematics, physics, biology and the social sciences. Compound random sums are extensions of classical random sums when the numbers of independent summands in sums are partial sums of independent identically distributed positive integer-valued random variables, assumed independent of summands of sums. The main aim of this paper is to introduce central limit theorems for normalized compound random sums of independent random variables and establish the convergence rates in types of small-o and large- $$\mathcal{O}$$ estimates, in term of Trotter-distance. The obtained results in this paper are extensions of several known ones.

In this paper, by using linear forms in logarithms and the Baker–Davenport reduction procedure we prove that there are no even perfect numbers appearing in generalized Pell sequences. We also deduce some interesting results involving generalized Pell numbers, which we believe are of independent interest. This paper continues a previous work that searched for perfect numbers in the classical Pell sequence.

Special units are a sort of predecessor of Euler systems, and they are mainly used to obtain annihilators for class groups. So one is interested in finding as many special units as possible (actually we use a technical generalization called “semispecial”). In this paper we show that in any abelian field having a real genus field in the narrow sense all Washington units are semispecial, and that a slightly weaker statement holds true for all abelian fields. The group of Washington units is very often larger than Sinnott’s group of cyclotomic units. In a companion paper we will show that in concrete families of abelian fields the group of Washington units is much larger than that of Sinnott units, by giving lower bounds on the index. Combining this with the present paper gives strong annihilation results.

In this paper, we introduce a new family of generalized blending-type bivariate Bernstein operators which depends on four parameters $$s_{1}$$ , $$s_{2}$$ , $$\alpha _{1}$$ and $$\alpha _{2}$$ . Approximation properties of these operators are studied, and we obtain the rate of convergence in terms of mixed and partial modulus of continuities. Moreover, we prove a Korovkin- and a Voronovskaja-type theorems for these operators. The last part of the paper is devoted to the associated GBS operators. In this part, we study degree of approximation of the GBS operators in terms of mixed modulus of continuity. GBS operators obtained here give better approximation than the original operators to the function f(x, y). Finally, approximation properties of the suggested operators and their associated GBS operators are discussed on graphs, for some numerical examples to show how GBS operator gives better approximation to f(x, y). Also, approximation properties of the suggested operators for different values of parameters $$s_{1}$$ , $$s_{2}$$ , $$\alpha _{1}$$ and $$\alpha _{2}$$ are illustrated on graphs. It should be mentioned that any increase in $$\alpha _{i}$$ values or any decrease in $$s_{i}$$ values gives better approximation of the suggested operators to f(x, y).

In this paper, we introduce the notion of FI-t-lifting modules which is a proper generalization of both the concepts of t-lifting modules and FI-lifting modules. We show that a direct sum of FI-t-lifting modules is not FI-t-lifting, in general. It is also shown that if M is an FI-t-lifting module, then $${\overline{Z}}^2(M)$$ is a direct summand of M and $${\overline{Z}}^2(M)$$ is a noncosingular FI-lifting module. The last part of the paper is devoted to the study of amply supplemented FI-t-lifting modules.

A regular system is a Delone set in Euclidean space with a transitive group of symmetries or, in other words, the orbit of a crystallographic group. The local theory for regular systems, created by the geometric school of B. N. Delone, was aimed, in particular, to rigorously establish the “local-global-order” link, i.e., the link between the arrangement of a set around each of its points and symmetry/regularity of the set as a whole. The main result of this paper is a proof of the so-called 10R-theorem. This theorem asserts that identity of neighborhoods within a radius 10R of all points of a Delone set (in other words, an (r, R)-system) in 3D Euclidean space implies regularity of this set. The result was obtained and announced long ago independently by M. Shtogrin and the author of this paper. However, a detailed proof remains unpublished for many years. In this paper, we give a proof of the 10R-theorem. In the proof, we use some recent results of the author, which simplify the proof.

We survey results about Haar null subsets of (not necessarily locally compact) Polish groups. The aim of this paper is to collect the fundamental properties of the various possible definitions of Haar null sets, and also to review the techniques that may enable the reader to prove results in this area. We also present several recently introduced ideas, including the notion of Haar meager sets, which are closely analogous to Haar null sets. We prove some results in a more general setting than that of the papers where they were originally proved and prove some results for Haar meager sets which were already known for Haar null sets.

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.

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.

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

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

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.

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.

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$.

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 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 link between Vandiver’s conjecture and Gauss sums is well known since the papers of Iwasawa (Symposia Mathematica, vol 15, Academic Press, pp 447–459, 1975), Thaine (Mich Math J 42(2):311–344, 1995; Trans Am Math Soc 351(12):4769–4790, 1999) and Angles and Nuccio (Acta Arith 142(3):199–218, 2010). This conjecture is required in many subjects and we shall give such examples of relevant references. In this paper, we recall our interpretation of Vandiver’s conjecture in terms of minus part of the torsion of the Galois group of the maximal abelian p-ramified pro-p-extension of the p-th cyclotomic field (Sur la p-ramification abelienne (1984) vol. 20, pp. 1–26). Then we provide a specific use of Gauss sums of characters of order p of $${\mathbb {F}}_\ell ^\times $$ and prove new criteria for Vandiver’s conjecture to hold (Theorem 2 (a) using both the sets of exponents of p-irregularity and of p-primarity of suitable twists of the Gauss sums, and Theorem 2 (b) which does not need the knowledge of Bernoulli numbers or cyclotomic units). We propose in §5.2 new heuristics showing that any counterexample to the conjecture leads to excessive constraints modulo p on the above twists as $$\ell $$ varies and suggests analytical approaches to evidence. We perform numerical experiments to strengthen our arguments in the direction of the very probable truth of Vandiver’s conjecture and to inspire future research. The calculations with their PARI/GP programs are given in appendices.

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various approaches to graph limits fit to this framework and that they naturally appear as "tractable cases" of a general theory. As an outcome of this, we provide extensions of known results. We believe that this put these into next context and perspective. For example, we prove that the sparse--dense dichotomy exactly corresponds to random free graphons. The second part of the paper is devoted to the study of sparse structures. First, we consider limits of structures with bounded diameter connected components and we prove that in this case the convergence can be "almost" studied component-wise. We also propose the structure of limits objects for convergent sequences of sparse structures. Eventually, we consider the specific case of limits of colored rooted trees with bounded height and of graphs with bounded tree-depth, motivated by their role of elementary brick these graphs play in decompositions of sparse graphs, and give an explicit construction of a limit object in this case. This limit object is a graph built on a standard probability space with the property that every first-order definable set of tuples is measurable. This is an example of the general concept of {\em modeling} we introduce here. Our example is also the first "intermediate class" with explicitly defined limit structures., Comment: added journal reference

We present a covering conjecture that we expect to be true below superstrong cardinals. We then show that the conjecture is true in hod mice. This work is a continuation of the work that started in Covering with Universally Baire Functions Advances in Mathematics, and the main conjecture of the current paper is a revision of the UB Covering Conjecture of the aforementioned paper.

A cut $\varepsilon$-sparsifier of a weighted graph $G$ is a re-weighted subgraph of $G$ of (quasi)linear size that preserves the size of all cuts up to a multiplicative factor of $\varepsilon$. Since their introduction by Bencz\'ur and Karger [STOC'96], cut sparsifiers have proved extremely influential and found various applications. Going beyond cut sparsifiers, Filtser and Krauthgamer [SIDMA'17] gave a precise classification of which binary Boolean CSPs are sparsifiable. In this paper, we extend their result to binary CSPs on arbitrary finite domains., Comment: Full version of a STACS'19 paper