Search

Let $S \subset \Bbb R^n$ be a smooth compact hypersurface with a strictly positive second fundamental form, $E$ be the Fourier extension operator on $S$, and $X$ be a Lebesgue measurable subset of $\Bbb R^n$. If $X$ contains a ball of each radius, then the problem of determining the range of exponents $(p,q)$ for which the estimate $\| Ef \|_{L^q(X)} \leq C \| f \|_{L^p(S)}$ holds is equivalent to the restriction conjecture. In this paper, we study the estimate under the following assumption on the set $X$: there is a number $0 < \alpha \leq n$ such that $|X \cap B_R| \leq c \, R^\alpha$ for all balls $B_R$ in $\Bbb R^n$ of radius $R \geq 1$. On the left-hand side of this estimate, we are integrating the function $|Ef(x)|^q$ against the measure $\chi_X dx$. Our approach consists of replacing the characteristic function $\chi_X$ of $X$ by an appropriate weight function $H$, and studying the resulting estimate in three different regimes: small values of $\alpha$, intermediate values of $\alpha$, and large values of $\alpha$. In the first regime, we establish the estimate by using already available methods. In the second regime, we prove a weighted H\"{o}lder-type inequality that holds for general non-negative Lebesgue measurable functions on $\Bbb R^n$, and combine it with the result from the first regime. In the third regime, we borrow a recent fractal Fourier restriction theorem of Du and Zhang and combine it with the result from the second regime. In the opposite direction, the results of this paper improve on the Du-Zhang theorem in the range $0 < \alpha < n/2$., Comment: 31 pages. Minor revision

Let $\unicode[STIX]{x1D703}$ be an irrational real number. The map $T_{\unicode[STIX]{x1D703}}:y\mapsto (y+\unicode[STIX]{x1D703})\!\hspace{0.6em}{\rm mod}\hspace{0.2em}1$ from the unit interval $\mathbf{I}= [\!0,1\![$ (endowed with the Lebesgue measure) to itself is ergodic. In a short paper [Parry, Automorphisms of the Bernoulli endomorphism and a class of skew-products. Ergod. Th. & Dynam. Sys.16 (1996), 519–529] published in 1996, Parry provided an explicit isomorphism between the measure-preserving map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ and the unilateral dyadic Bernoulli shift when $\unicode[STIX]{x1D703}$ is extremely well approximated by the rational numbers, namely, if $$\begin{eqnarray}\inf _{q\geq 1}q^{4}4^{q^{2}}~\text{dist}(\unicode[STIX]{x1D703},q^{-1}\mathbb{Z})=0.\end{eqnarray}$$ A few years later, Hoffman and Rudolph [Uniform endomorphisms which are isomorphic to a Bernoulli shift. Ann. of Math. (2)156 (2002), 79–101] showed that for every irrational number, the measure-preserving map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ is isomorphic to the unilateral dyadic Bernoulli shift. Their proof is not constructive. In the present paper, we relax notably Parry’s condition on $\unicode[STIX]{x1D703}$: the explicit map provided by Parry’s method is an isomorphism between the map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ and the unilateral dyadic Bernoulli shift whenever $$\begin{eqnarray}\inf _{q\geq 1}q^{4}~\text{dist}(\unicode[STIX]{x1D703},q^{-1}\mathbb{Z})=0.\end{eqnarray}$$ This condition can be relaxed again into $$\begin{eqnarray}\inf _{n\geq 1}q_{n}^{3}~(a_{1}+\cdots +a_{n})~|q_{n}\unicode[STIX]{x1D703}-p_{n}| where $[0;a_{1},a_{2},\ldots ]$ is the continued fraction expansion and $(p_{n}/q_{n})_{n\geq 0}$ the sequence of convergents of $\Vert \unicode[STIX]{x1D703}\Vert :=\text{dist}(\unicode[STIX]{x1D703},\mathbb{Z})$. Whether Parry’s map is an isomorphism for every $\unicode[STIX]{x1D703}$ or not is still an open question, although we expect a positive answer.

The HOD Dichotomy Theorem states that if there is an extendible cardinal, δ, then either HOD is “close” to V (in the sense that it correctly computes successors of singular cardinals greater than δ) or HOD is “far” from V (in the sense that all regular cardinals greater than or equal to δ are measurable in HOD). The question is whether the future will lead to the first or the second side of the dichotomy. Is HOD “close” to V, or “far” from V? There is a program aimed at establishing the first alternative—the “close” side of the HOD Dichotomy. This is the program of inner model theory. In recent years the third author has provided evidence that there is an ultimate inner model—Ultimate-L—and he has isolated a natural conjecture associated with the model—the Ultimate-L Conjecture. This conjecture implies that (assuming the existence of an extendible cardinal) that the first alternative holds—HOD is “close” to V. This is the future in which pattern prevails. In this paper we introduce a very different program, one aimed at establishing the second alternative—the “far” side of the HOD Dichotomy. This is the program of large cardinals beyond choice. Kunen famously showed that if AC holds then there cannot be a Reinhardt cardinal. It has remained open whether Reinhardt cardinals are consistent in ZF alone. It turns out that there is an entire hierarchy of choiceless large cardinals of which Reinhardt cardinals are only the beginning, and, surprisingly, this hierarchy appears to be highly ordered and amenable to systematic investigation, as we shall show in this paper. The point is that if these choiceless large cardinals are consistent then the Ultimate-L Conjecture must fail. This is the future where chaos prevails.

Let${\mathcal{S}}$be the family of analytic and univalent functions$f$in the unit disk$\mathbb{D}$with the normalization$f(0)=f^{\prime }(0)-1=0$, and let$\unicode[STIX]{x1D6FE}_{n}(f)=\unicode[STIX]{x1D6FE}_{n}$denote the logarithmic coefficients of$f\in {\mathcal{S}}$. In this paper we study bounds for the logarithmic coefficients for certain subfamilies of univalent functions. Also, we consider the families${\mathcal{F}}(c)$and${\mathcal{G}}(c)$of functions$f\in {\mathcal{S}}$defined by$$\begin{eqnarray}\text{Re}\biggl(1+{\displaystyle \frac{zf^{\prime \prime }(z)}{f^{\prime }(z)}}\biggr)>1-{\displaystyle \frac{c}{2}}\quad \text{and}\quad \text{Re}\biggl(1+{\displaystyle \frac{zf^{\prime \prime }(z)}{f^{\prime }(z)}}\biggr)for some$c\in (0,3]$and$c\in (0,1]$, respectively. We obtain the sharp upper bound for$|\unicode[STIX]{x1D6FE}_{n}|$when$n=1,2,3$and$f$belongs to the classes${\mathcal{F}}(c)$and${\mathcal{G}}(c)$, respectively. The paper concludes with the following two conjectures:∙If$f\in {\mathcal{F}}(-1/2)$, then$|\unicode[STIX]{x1D6FE}_{n}|\leq 1/n(1-(1/2^{n+1}))$for$n\geq 1$, and$$\begin{eqnarray}\mathop{\sum }_{n=1}^{\infty }|\unicode[STIX]{x1D6FE}_{n}|^{2}\leq {\displaystyle \frac{\unicode[STIX]{x1D70B}^{2}}{6}}+{\displaystyle \frac{1}{4}}~\text{Li}_{2}\biggl({\displaystyle \frac{1}{4}}\biggr)-\text{Li}_{2}\biggl({\displaystyle \frac{1}{2}}\biggr),\end{eqnarray}$$where$\text{Li}_{2}(x)$denotes the dilogarithm function.∙If$f\in {\mathcal{G}}(c)$, then$|\unicode[STIX]{x1D6FE}_{n}|\leq c/2n(n+1)$for$n\geq 1$.

In 2005, using a famous lemma of Atkin and Swinnerton-Dyer (Some properties of partitions, Proc. Lond. Math. Soc. (3)4(1954), 84–106), Yesilyurt (Four identities related to third order mock theta functions in Ramanujan’s lost notebook, Adv. Math. 190(2005), 278–299) proved four identities for third order mock theta functions found on pages 2 and 17 in Ramanujan’s lost notebook. The primary purpose of this paper is to offer new proofs in the spirit of what Ramanujan might have given in the hope that a better understanding of the identities might be gained. Third order mock theta functions are intimately connected with ranks of partitions. We prove new dissections for two rank generating functions, which are keys to our proof of the fourth, and the most difficult, of Ramanujan’s identities. In the last section of this paper, we establish new relations for ranks arising from our dissections of rank generating functions.

Tangential quadrilaterals are defined to be quadrilaterals in which a circle can be inscribed that is tangent to all four sides. It is well known and easy to prove that a convex quadrilateral is tangential if, and only if, the angle bisectors of all four vertex angles are concurrent at a point, which is the centre of the inscribed circle (incircle). The most well-known and in problem solving useful characterisation of tangential quadrilaterals is Pitot's theorem, which states that a convex quadrilateral is tangential if and only if its consecutive sides a, b, c, d satisfy the relation a + c = b + d [1, pp. 64-67]. If you want to have more background information about characterisations of tangential quadrilaterals, then we recommend you to check out the lovely papers [2, 3, 4], as well as our previous contributions on the subject [5, 6, 7]. These six papers together include about 30 characterisations that are either proved or reviewed there with references.

The general class of quadrilaterals where one diagonal is bisected by the other diagonal has appeared very rarely in the geometrical literature, but they have been named several times in connection with quadrilateral classifications. Günter Graumann strangely gave these objects two different names in [1, pp. 192, 194]: sloping-kite and sliding-kite. A. Ramachandran called them slant kites in [2, p. 54] and Michael de Villiers called them bisecting quadrilaterals in [3, pp. 19, 206]. The latter is a pretty good name, although a bit confusing: what exactly is bisected?We have found no papers and only two books where any theorems on such quadrilaterals are studied. In each of the books, one necessary and sufficient condition for such quadrilaterals is proved (see Theorem 1 and 2 in the next section). The purpose of this paper is to investigate basic properties of convex bisecting quadrilaterals, but we have chosen to give them a slightly different name. Let us first remind the reader that a quadrilateral whose diagonals have equal lengths is called an equidiagonal quadrilateral and one whose diagonals are perpendicular is called an orthodiagonal quadrilateral.

In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most ${n-1\choose k-1}$. We say that two non-empty families are $\mathcal A, \mathcal B\subset {[n]\choose k}$ are {\it $s$-cross-intersecting}, if for any $A\in\mathcal A,B\in \mathcal B$ we have $|A\cap B|\ge s$. In this paper we determine the maximum of $|\mathcal A|+|\mathcal B|$ for all $n$. This generalizes a result of Hilton and Milner, who determined the maximum of $|\mathcal A|+|\mathcal B|$ for nonempty $1$-cross-intersecting families., Comment: This article was previously a portion of arXiv:1603.00938v1, which has been split

This paper is a continuation of Amidei, Pianigiani, San Mauro, Simi, & Sorbi (2016), where we have introduced the quasidialectical systems, which are abstract deductive systems designed to provide, in line with Lakatos’ views, a formalization of trial and error mathematics more adherent to the real mathematical practice of revision than Magari’s original dialectical systems. In this paper we prove that the two models of deductive systems (dialectical systems and quasidialectical systems) have in some sense the same information content, in that they represent two classes of sets (the dialectical sets and the quasidialectical sets, respectively), which have the same Turing degrees (namely, the computably enumerable Turing degrees), and the same enumeration degrees (namely, the ${\rm{\Pi }}_1^0$ enumeration degrees). Nonetheless, dialectical sets and quasidialectical sets do not coincide. Even restricting our attention to the so-called loopless quasidialectical sets, we show that the quasidialectical sets properly extend the dialectical sets. As both classes consist of ${\rm{\Delta }}_2^0$ sets, the extent to which the two classes differ is conveniently measured using the Ershov hierarchy: indeed, the dialectical sets are ω-computably enumerable (close inspection also shows that there are dialectical sets which do not lie in any finite level; and in every finite level n ≥ 2 of the Ershov hierarchy there is a dialectical set which does not lie in the previous level); on the other hand, the quasidialectical sets spread out throughout all classes of the hierarchy (close inspection shows that for every ordinal notation a of a nonzero computable ordinal, there is a quasidialectical set lying in ${\rm{\Sigma }}_a^{ - 1}$, but in none of the preceding levels).

A setisshyorHaar null(in the sense of Christensen) if there exists a Borel setand a Borel probability measureμonC[0, 1] such thatandfor allf∈C[0, 1]. The complement of a shy set is called aprevalentset. We say that a set isHaar ambivalentif it is neither shy nor prevalent.The main goal of the paper is to answer the following question: what can we say about the topological properties of the level sets of the prevalent/non-shy manyf∈C[0, 1]?The classical Bruckner–Garg theorem characterizes the level sets of the generic (in the sense of Baire category)f∈C[0, 1] from the topological point of view. We prove that the functionsf∈C[0, 1] for which the same characterization holds form a Haar ambivalent set.In an earlier paper, Balkaet al. proved that the functionsf∈C[0, 1] for which positively many level sets with respect to the Lebesgue measure λ are singletons form a non-shy set inC[0, 1]. The above result yields that this set is actually Haar ambivalent. Now we prove that the functionsf∈C[0, 1] for which positively many level sets with respect to the occupation measure λ ◦f–1are not perfect form a Haar ambivalent set inC[0, 1].We show that for the prevalentf∈C[0, 1] for the genericy∈f([0, 1]) the level setf–1(y) is perfect. Finally, we answer a question of Darji and White by showing that the set of functionsf∈C[0, 1] for which there exists a perfect setPf⊂ [0, 1] such thatfʹ(x) = ∞ for allx∈Pfis Haar ambivalent.

This paper contributes to the regular covers of a complete bipartite graph minus a matching, denoted $K_{n,n}-nK_{2}$, whose fiber-preserving automorphism group acts 2-arc-transitively. All such covers, when the covering transformation group $K$ is either cyclic or $\mathbb{Z}_{p}^{2}$ with $p$ a prime, have been determined in Xu and Du [‘2-arc-transitive cyclic covers of $K_{n,n}-nK_{2}$’, J. Algebraic Combin.39 (2014), 883–902] and Xu et al. [‘2-arc-transitive regular covers of $K_{n,n}-nK_{2}$ with the covering transformation group $\mathbb{Z}_{p}^{2}$’, Ars. Math. Contemp.10 (2016), 269–280]. Finally, this paper gives a classification of all such covers for $K\cong \mathbb{Z}_{p}^{3}$ with $p$ a prime.

De Bruijn's identity shows a link between two fundamental concepts in information theory: entropy and Fisher information. In the literature, De Bruijn's identity has been stated under the assumption of independence between input signal and an additive noise. However, in the real world, the noise could be highly dependent on the main signal. The main aim of this paper is, firstly, to extend De bruijn's identity for signal-dependent noise channels and, secondly, to study how Stein and heat identities are related to De bruijn's identity. Thus, new versions of De Bruijn's identity are introduced in the case when input signal and additive noise are dependent and are jointly distributed according to Archimedean and Gaussian copulas. It is shown that in this generalized model, the derivatives of the differential entropy can be expressed in terms of a function of Fisher information. Our finding enfolds the conventional De Bruijn's identity as some remarks. Then, the equivalence among the new De Bruijn-type identity, Stein's identity and heat equation identity is established. The paper concludes with an application of the developed results in information theory.

A family of sets is called union-closed if wheneverAandBare sets of the family, so isA∪B. The long-standing union-closed conjecture states that if a family of subsets of [n] is union-closed, some element appears in at least half the sets of the family. A natural weakening is that the union-closed conjecture holds for large families, that is, families consisting of at leastp02nsets for some constantp0. The first result in this direction appears in a recent paper of Balla, Bollobás and Eccles [1], who showed that union-closed families of at least$\tfrac{2}{3}$2nsets satisfy the conjecture; they proved this by determining the minimum possible average size of a set in a union-closed family of given size. However, the methods used in that paper cannot prove a better constant than$\tfrac{2}{3}$. Here, we provide a stability result for the main theorem of [1], and as a consequence we prove the union-closed conjecture for families of at least ($\tfrac{2}{3}$−c)2nsets, for a positive constantc.

In this paper we study the speed of infection spread and the survival of the contact process in the random geometric graph G = G(n, r n , f) of n nodes independently distributed in S = [-½, ½]2 according to a certain density f(·). In the first part of the paper we assume that infection spreads from one node to another at unit rate and that infected nodes stay in the same state forever. We provide an explicit lower bound on the speed of infection spread and prove that infection spreads in G with speed at least D 1 nr n 2. In the second part of the paper we consider the contact process ξ t on G where infection spreads at rate λ > 0 from one node to another and each node independently recovers at unit rate. We prove that, for every λ > 0, with high probability, the contact process on G survives for an exponentially long time; there exist positive constants c 1 and c 2 such that, with probability at least 1 - c 1 / n 4, the contact process starting with all nodes infected survives up to time t n = exp(c 2 n/logn) for all n.

Suppose that X 1, …, X n are random variables with the same known marginal distribution F but unknown dependence structure. In this paper we study the smallest possible value of P(X 1 + · · · + X n < s) over all possible dependence structures, denoted by m n,F (s). We show that m n,F (ns) → 0 for s no more than the mean of F under weak assumptions. We also derive a limit of m n,F (ns) for any s ∈ R with an error of at most n -1/6 for general continuous distributions. An application of our result to risk management confirms that the worst-case value at risk is asymptotically equivalent to the worst-case expected shortfall for risk aggregation with dependence uncertainty. In the last part of this paper we present a dual presentation of the theory of complete mixability and give dual proofs of theorems in the literature on this concept.

The tensor product (G1,G2) of a graph G1 and a pointed graph G2 (containing one distinguished edge) is obtained by identifying each edge of G1 with the distinguished edge of a separate copy of G2, and then removing the identified edges. A formula to compute the Tutte polynomial of a tensor product of graphs was originally given by Brylawski. This formula was recently generalized to coloured graphs and the generalized Tutte polynomial introduced by Bollobás and Riordan. In this paper we generalize the coloured tensor product formula to relative Tutte polynomials of relative graphs, containing zero edges to which the usual deletion/contraction rules do not apply. As we have shown in a recent paper, relative Tutte polynomials may be used to compute the Jones polynomial of a virtual knot.

Let $({\mathcal X}, d, \mu)$ be a metric measure space and satisfy the so-called upper doubling condition and the geometrical doubling condition. In this paper, we introduce the atomic Hardy space $H^1(\mu)$ and prove that its dual space is the known space ${\rm RBMO}(\mu)$ in this context. Using this duality, we establish a criterion for the boundedness of linear operators from $H^1(\mu)$ to any Banach space. As an application of this criterion, we obtain the boundedness of Calder\'on--Zygmund operators from $H^1(\mu)$ to $L^1(\mu)$., Comment: This paper has been withdrawn by the authors, since it has already been published

This paper provides a simple proof for the fact that the hitting time to an infrequently visited subset for a one-dependent regenerative process converges weakly to an exponential distribution. Special cases are positive recurrent Harris chains and Harris processes. The paper further extends this class of limit theorems to ‘rewards’ that are cumulated to the hitting time of such a rare set.

We prove the so-called inverse conjecture for the Gowers U^{s+1}-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we establish that if f : [N] -> C is a function with |f(n)| = ��then there is a bounded complexity 3-step nilsequence F(g(n)��) which correlates with f. The approach seems to generalise so as to prove the inverse conjecture for s >= 4 as well, and a longer paper will follow concerning this. By combining this with several previous papers of the first two authors one obtains the generalised Hardy-Littlewood prime-tuples conjecture for any linear system of complexity at most 3. In particular, we have an asymptotic for the number of 5-term arithmetic progressions p_1 < p_2 < p_3 < p_4 < p_5, 49 pages, to appear in Glasgow J. Math. Fixed a problem with the file (the paper appeared in duplicate)

In this paper, the componentwise increasing convex order, the upper orthant order, the upper orthant convex order, and the increasing directionally convex order for random vectors are generalized to hierarchical classes of integral stochastic order relations. The elements of the generating classes of functions possess nonnegative partial derivatives up to some given degrees. Some properties of these new stochastic order relations are studied. Particular attention is paid to the comparison of weighted sums of the respective components of ordered random vectors. By providing a unified derivation of standard multivariate stochastic orderings, the present paper shows how some well-known results derive from a common principle.

We present new ideas about the type of random tessellation which evolves through successive division of its cells. These ideas are developed in an intuitive way, with many pictures and only a modicum of mathematical formalism–so that the wide application of the ideas is clearly apparent to all readers. A vast number of new tessellation models, with known probability distribution for the volume of the typical cell, follow from the concepts in this paper. There are other interesting models for which results are not presented (or presented only through simulation methods), but these models have illustrative value. A large agenda of further research is opened up by the ideas in this paper.

Nice polynomials are polynomials whose coefficients, roots, and critical points are integers. The earliest papers on nice polynomials [1, 2, 3] give an explicit formula for all nice cubics. All the derivations of this formula use Pythagorean triples.In 1999 the problem of finding, constructing, and classifying nice polynomials was added to the list of unsolved problems [4] in The American Mathematical Monthly. Other papers soon followed, including [5] and [6], with extending the results of nice polynomials to polynomials with coefficients, roots, and critical points in integral domains D. Such polynomials are called D-nice.

In this paper we investigate the ‘local’ properties of a random mapping model, T n D̂, which maps the set {1, 2, …, n} into itself. The random mapping T n D̂ , which was introduced in a companion paper (Hansen and Jaworski (2008)), is constructed using a collection of exchangeable random variables D̂ 1, …, D̂ n which satisfy In the random digraph, G n D̂ , which represents the mapping T n D̂ , the in-degree sequence for the vertices is given by the variables D̂ 1, D̂ 2, …, D̂ n , and, in some sense, G n D̂ can be viewed as an analogue of the general independent degree models from random graph theory. By local properties we mean the distributions of random mapping characteristics related to a given vertex v of G n D̂ - for example, the numbers of predecessors and successors of v in G n D̂ . We show that the distribution of several variables associated with the local structure of G n D̂ can be expressed in terms of expectations of simple functions of D̂ 1, D̂ 2, …, D̂ n . We also consider two special examples of T n D̂ which correspond to random mappings with preferential and anti-preferential attachment, and determine, for these examples, exact and asymptotic distributions for the local structure variables considered in this paper. These distributions are also of independent interest.

Let (X, O) be a germ of a normal surface singularity, π: → X be the minimal resolution of singularities and let A = (ai,j) be the n × n symmetrical intersection matrix of the exceptional set of In an old preprint Nash proves that the set of arcs on a surface singularity is a scheme , and defines a map from the set of irreducible components of to the set of exceptional components of the minimal resolution of singularities of (X,O). He proved that this map is injective and ask if it is surjective. In this paper we consider the canonical decomposition •For any couple (Ei,Ej) of distinct exceptional components, we define Numerical Nash condition (NN(i,j)). We have that (NN(i,j)) implies In this paper we prove that (NN(i,j)) is always true for at least the half of couples (i,j).•The condition (NN(i,j)) is true for all couples (i,j) with i ≠ j, characterizes a certain class of negative definite matrices, that we call Nash matrices. If A is a Nash matrix then the Nash map N is bijective. In particular our results depend only on A and not on the topological type of the exceptional set.•We recover and improve considerably almost all results known on this topic and our proofs are new and elementary.•We give infinitely many other classes of singularities where Nash Conjecture is true.The proofs are based on my old work [8] and in Plenat [10].

Consider a sequence X = (Xn: n ≥ 1) of independent and identically distributed random variables, and an independent geometrically distributed random variable M with parameter p. The random variable SM = X1 + ∙ ∙ ∙ + XM is called a geometric sum. In this paper we obtain asymptotic expansions for the distribution of SM as p ↘ 0. If EX1 > 0, the asymptotic expansion is developed in powers of p and it provides higher-order correction terms to Renyi's theorem, which states that P(pSM > x) ≈ exp(-x/EX1). Conversely, if EX1 = 0 then the expansion is given in powers of √p. We apply the results to obtain corrected diffusion approximations for the M/G/1 queue. These expansions follow in a unified way as a consequence of new uniform renewal theory results that are also developed in this paper.

This thesis consists of four papers.In paper 1, we prove central limit theorems for Markov chains under (local) contraction conditions. As a corollary we obtain a central limit theorem for Markov chains associated with iterated function systems with contractive maps and place-dependent Dini-continuous probabilities.In paper 2, properties of inverse subordinators are investigated, in particular similarities with renewal processes. The main tool is a theorem on processes that are both renewal and Cox processes.In paper 3, distributional properties of supercritical and especially immortal branching processes are derived. The marginal distributions of immortal branching processes are found to be compound geometric.In paper 4, a description of a dynamic population model is presented, such that samples from the population have genealogies as given by a Lambda-coalescent with mutations. Depending on whether the sample is grouped according to litters or families, the sampling distribution is either regenerative or non-regenerative.

The full-information best-choice problem, as posed by Gilbert and Mosteller in 1966, asks us to find a stopping rule which maximizes the probability of selecting the largest of a sequence of n i.i.d. standard uniform random variables. Porosiński, in 1987, replaced a fixed n by a random N, uniform on {1,2,…,n} and independent of the observations. A partial-information problem, imbedded in a 1980 paper of Petruccelli, keeps n fixed but allows us to observe only the sequence of ranges (max - min), as well as whether or not the current observation is largest so far. Recently, Porosiński compared the solutions to his and Petruccelli's problems and found that the two problems have identical optimal rules as well as risks that are asymptotically equal. His discovery prompts the question: why? This paper gives a good explanation of the equivalence of the optimal rules. But even under the lens of a planar Poisson process model, it leaves the equivalence of the asymptotic risks as somewhat of a mystery. Meanwhile, two other problems have been shown to have the same limiting risks: the full-information problem with the (suboptimal) Porosiński-Petruccelli stopping rule, and the full-information ‘duration of holding the best’ problem of Ferguson, Hardwick and Tamaki, which turns out to be nothing but the Porosiński problem in disguise.

We study the asymptotic properties of a minimal spanning tree formed by n points uniformly distributed in the unit square, where the minimality is amongst all rooted spanning trees with a direction of growth. We show that the number of branches from the root of this tree, the total length of these branches, and the length of the longest branch each converges weakly. This model is related to the study of record values in the theory of extreme-value statistics and this relation is used to obtain our results. The results also hold when the tree is formed from a Poisson point process of intensity n in the unit square. In this paper we introduce a notion of a minimal directed spanning tree. To illustrate this, consider the following model of transmission of radio waves by transmitters, receivers and amplifiers. Suppose a source transmitter located at the origin transmits messages which can be received only by receivers placed in the positive quadrant. These receivers in turn amplify the message and transmit it to the receivers lying in the positive quadrant with respect to these amplifiers. In this way each receiver lying in the positive quadrant with respect to the transmitter receives the message. The graph which represents this model of transmission may be viewed as a directed spanning tree. For transmission of radio waves in this model, the required strength of the source transmitter is clearly related to the number of receivers which receive the message directly from the transmitter at the origin, as well as the sum of the distances of these receivers from the origin and the distance of the receiver farthest away from the origin which receives the message directly from the origin. In this paper we investigate these three factors when the receivers are located at random in the unit square (say) and we study the asymptotics as the number of transmitters goes to infinity. This model of transmission of radio waves is in contrast to that introduced by Gilbert (1961) where the radio waves can travel in any direction from the point of their origin. However, they may be received only by receivers located within a certain fixed distance from the source of transmission.

The test ideal $\tau(R)$ of a ring $R$ of prime characteristic is an important object in the theory of tight closure. In this paper, we study a generalization of the test ideal, which is the ideal $\tau(\a^t)$ associated to a given ideal $\a$ with rational exponent $t \ge 0$. We first prove a key lemma of this paper, which gives a characterization of the ideal $\tau(\a^t)$. As applications of this key lemma, we generalize the preceding results on the behavior of the test ideal $\tau(R)$. Moreover, we prove an analog of so-called Skoda's theorem, which is formulated algebraically via adjoint ideals by Lipman in his proof of the "modified Brian\c{c}on--Skoda theorem.", Comment: 11 pages, AMS-LaTeX; v.2: minor changes, to appear in Nagoya Math. J

Suppose that {X s , 0 ≤ s ≤ T} is an m-dimensional geometric Brownian motion with drift, μ is a bounded positive Borel measure on [0,T], and ϕ : ℝ m → [0,∞) is a (weighted) l q (ℝ m )-norm, 1 ≤ q ≤ ∞. The purpose of this paper is to study the distribution and the moments of the random variable Y given by the L p (μ)-norm, 1 ≤ p ≤ ∞, of the function s ↦ ϕ(X s ), 0 ≤ s ≤ T. By using various geometric inequalities in Wiener space, this paper gives upper and lower bounds for the distribution function of Y and proves that the distribution function is log-concave and absolutely continuous on every open subset of the distribution's support. Moreover, the paper derives tail probabilities, presents sharp moment inequalities, and shows that Y is indetermined by its moments. The paper will also discuss the so-called moment-matching method for the pricing of Asian-styled basket options.

The purpose of this paper is to study ageing properties of first-passage times of increasing Markov chains. We extend the literature to some new ageing classes, such as the IFR(2), NBU(2), DRLLt and NBULt classes. We also give sufficient conditions in the finite case, that are more efficient computationally, just in terms of the transition matrix K, in the discrete case, or the generator matrix Q, in the continuous case. For the uniformizable, continuous-time Markov processes, we derive conditions in terms of the discrete uniformized Markov chain for the NBU(2) and the NBULt classes. In the last section, a review of the main results in this direction in the literature is given, and we compare some of the conditions stated in this paper with others given in the literature about some other ageing classes. Some examples where these results are applied are given.

Recently in the paper by Møller and Zuyev (1996), the following Gamma-type result was established. Given n points of a homogeneous Poisson process defining a random figure, its volume is Γ(n,λ) distributed, where λ is the intensity of the process. In this paper we give an alternative description of the class of random sets for which the Gamma-type results hold. We show that it corresponds to the class of stopping sets with respect to the natural filtration of the point process with certain scaling properties. The proof uses the martingale technique for directed processes, in particular, an analogue of Doob's optional sampling theorem proved in Kurtz (1980). As well as being compact, this approach provides a new insight into the nature of geometrical objects constructed with respect to a Poisson point process. We show, in particular, that in this framework the probability that a point is covered by a stopping set does not depend on whether it is a point of the process or not.

In this paper, in work strongly related with that of Coffman et al. [5], Bruss and Robertson [2], and Rhee and Talagrand [15], we focus our interest on an asymptotic distributional comparison between numbers of ‘smallest’ i.i.d. random variables selected by either on-line or off-line policies. Let X 1,X 2,… be a sequence of i.i.d. random variables with distribution function F(x), and let X 1,n ,…,X n,n be the sequence of order statistics of X 1,…,X n . For a sequence (c n ) n≥1 of positive constants, the smallest fit off-line counting random variable is defined by N e (c n ) := max {j ≤ n : X 1,n + … + X j,n ≤ c n }. The asymptotic joint distributional comparison is given between the off-line count N e (c n ) and on-line counts N n τ for ‘good’ sequential (on-line) policies τ satisfying the sum constraint ∑ j≥1 X τ j I (τ j ≤n) ≤ c n . Specifically, for such policies τ, under appropriate conditions on the distribution function F(x) and the constants (c n ) n≥1, we find sequences of positive constants (B n ) n≥1, (Δ n ) n≥1 and (Δ' n ) n≥1 such that for some non-degenerate random variables W and W'. The major tools used in the paper are convergence of point processes to Poisson random measure and continuous mapping theorems, strong approximation results of the normalized empirical process by Brownian bridges, and some renewal theory.

The Brocard points P and P' of the triangle ABC, illustrated in Figure 1, are such that ∠PAB = ∠PBC = ∠PCA = ω and ∠P'BA = ∠P'CB = ∠P'AC = ω. Problem 78.A in the March 1994 edition of the Mathematical Gazette required a proof that the maximum length of PP' is R/2, where R is the circumradius of triangle ABC. The solution given by various solvers in the November 1994 edition of the Gazette is essentially the same as appeared in a paper by H. E. Piggott in the Gazette in 1924. In the present paper various properties of the triangle and its Brocard points are established in terms of the lengths of the sides of the triangle. Some of the results may be new, but the methods used encompass ‘Mathematics Ancient and Modern’ in the guises of homogeneous areal coordinates and computer algebra!

We consider the exact distribution of the number of peaks in a random permutation of the integers 1, 2, ···, n. This arises from a test of whether n successive observations from a continuous distribution are i.i.d. The Eulerian numbers, which figure in the p.g.f., are then shown to provide a link between the simpler problem of ascents (which has been thoroughly analysed) and both our problem of peaks and similar problems on the circle. This link then permits easy deduction of certain general properties, such as linearity in n of the cumulants, in the more complex settings. Since the focus of the paper is on exact distributional results, a uniform bound on the deviation from the limiting normal is included. A secondary purpose of the paper is synthesis, beginning with the more familiar setting of peaks and troughs.

Gireesh and Mahadeva Naika [‘On 3-regular partitions in 3-colors’, Indian J. Pure Appl. Math.50 (2019), 137–148] proved an infinite family of congruences modulo powers of 3 for the function $p_{\{3,3\}}(n)$ , the number of 3-regular partitions in three colours. In this paper, using elementary generating function manipulations and classical techniques, we significantly extend the list of proven arithmetic properties satisfied by $p_{\{3,3\}}(n).$

We consider products of an independent and identically distributed sequence in a set $\{f_1,\ldots ,f_m\}$ of orientation-preserving diffeomorphisms of the circle. We can naturally associate a Lyapunov exponent $\lambda $ . Under few assumptions, it is known that $\lambda \leq 0$ and that the equality holds if and only if $f_1,\ldots ,f_m$ are simultaneously conjugated to rotations. In this paper, we state a quantitative version of this fact in the case where $f_1,\ldots ,f_m$ are $C^k$ perturbations of rotations with rotation numbers $\rho (f_1),\ldots ,\rho (f_m)$ satisfying a simultaneous diophantine condition in the sense of Moser [On commuting circle mappings and simultaneous diophantine approximations. Math. Z.205(1) (1990), 105–121]: we give a precise estimate of $\lambda $ (Taylor expansion) and we prove that there exist a diffeomorphism g and rotations $r_i$ such that $\mbox {dist}(gf_ig^{-1},r_i)\ll |\lambda |^{{1}/{2}}$ for $i=1,\ldots , m$ . We also state analogous results for random products of $2\times 2$ matrices, without any diophantine condition.

In this paper, we study the structure of the rational cohomology groups of the IA-automorphism group$\mathrm {IA}_3$of the free group of rank three by using combinatorial group theory and representation theory. In particular, we detect a nontrivial irreducible component in the second cohomology group of$\mathrm {IA}_3$, which is not contained in the image of the cup product map of the first cohomology groups. We also show that the triple cup product of the first cohomology groups is trivial. As a corollary, we obtain that the fourth term of the lower central series of$\mathrm {IA}_3$has finite index in that of the Andreadakis–Johnson filtration of$\mathrm {IA}_3$.

We present a sufficient condition for the $kG$-Scott module with vertex $P$ to remain indecomposable under the Brauer construction for any subgroup $Q$ of $P$ as $k[Q\,C_G(Q)]$-module, where $k$ is a field of characteristic $2$, and $P$ is a semidihedral $2$-subgroup of a finite group $G$. This generalizes results for the cases where $P$ is abelian or dihedral. The Brauer indecomposability is defined \linebreak by R.~Kessar, N.~Kunugi and N.~Mitsuhashi. The motivation of \linebreak this paper is a fact that the Brauer indecomposability of a $p$-permutation bimodule ($p$ is a prime) is one of the key steps in order to obtain a splendid stable equivalence of Morita type by making use of the gluing method due to Brou\'e, Rickard, Linckelmann and Rouquier, that then can possibly be lifted to a splendid derived (splendid Morita) equivalence., Comment: 10 pages

The notion of the capacity of a polynomial was introduced by Gurvits around 2005, originally to give drastically simplified proofs of the van der Waerden lower bound for permanents of doubly stochastic matrices and Schrijver’s inequality for perfect matchings of regular bipartite graphs. Since this seminal work, the notion of capacity has been utilised to bound various combinatorial quantities and to give polynomial-time algorithms to approximate such quantities (e.g. the number of bases of a matroid). These types of results are often proven by giving bounds on how much a particular differential operator can change the capacity of a given polynomial. In this paper, we unify the theory surrounding such capacity-preserving operators by giving tight capacity preservation bounds for all nondegenerate real stability preservers. We then use this theory to give a new proof of a recent result of Csikvári, which settled Friedland’s lower matching conjecture.

Theinjectiveversion of Cantor’s theorem appears in full second-order logic as the inconsistency of the abstraction principle, Frege’s Basic Law V (BLV), an inconsistency easily shown using Russell’s paradox. This incompatibility is akin to others—most notably that of a (Dedekind) infinite universe with the Nuisance Principle (NP) discussed by neo-Fregean philosophers of mathematics. This paper uses the Burali–Forti paradox to demonstrate this incompatibility, and another closely related, without appeal to principles related to the axiom of choice—a result hitherto unestablished. It discusses both the general interest of this result, its interest to neo-Fregean philosophy of mathematics, and the potential significance of the Burali–Fortian method of proof.

We have two aims in this paper. First, we generalize the well-known theory of matrix-geometric methods of Neuts to more complicated Markov chains. Second, we use the theory to solve a last-come-first-served queue with a generalized preemptive resume (LCFS-GPR) discipline. The structure of the Markov chain considered in this paper is one in which one of the variables can take values in a countable set, which is arranged in the form of a tree. The other variable takes values from a finite set. Each node of the tree can branch out into d other nodes. The steady-state solution of this Markov chain has a matrix product-form, which can be expressed as a function of d matrices Rl,· ··, Rd. We then use this theory to solve a multiclass LCFS-GPR queue, in which the service times have PH-distributions and arrivals are according to the Markov modulated Poisson process. In this discipline, when a customer's service is preempted in phase j (due to a new arrival), the resumption of service at a later time could take place in a phase which depends on j. We also obtain a closed form solution for the stationary distribution of an LCFS-GPR queue when the arrivals are Poisson. This result generalizes the known result on a LCFS preemptive resume queue, which can be obtained from Kelly's symmetric queue.

The hazard rate ordering is an ordering for random variables which compares lifetimes with respect to their hazard rate functions. It is stronger than the usual stochastic order for random variables, yet is weaker than the likelihood ratio ordering. The hazard rate ordering is particularly useful in reliability theory and survival analysis, owing to the importance of the hazard rate function in these areas. In this paper earlier work on the hazard rate ordering is reviewed, and extensive new results related to coherent systems are derived. Initially we fix the form of a coherent structure and investigate the effect on the hazard rate function of the system when we switch the lifetimes of its components from the vector (T 1, · ··, Tn ) to the vector (T′ 1, · ··, T′n ), where the hazard rate functions of the two vectors are assumed to be comparable in some sense. Although the hazard rate ordering is closed under the formation of series systems, we see that this is not the case for parallel systems even when the system is a two-component parallel system with exponentially distributed lifetimes. A positive result shows that for two-component parallel systems with proportional hazards (λ 1 r(t), λ 2 r(t))), the more diverse (λ 1, λ2 ) is in the sense of majorization the stronger is the system in the hazard rate ordering. Unfortunately even this result does not extend to parallel systems with more than two components, demonstrating again the delicate nature of the hazard rate ordering. The principal result of the paper concerns the hazard rate ordering for the lifetime of a k-out-of-n system. It is shown that if τ k|n is the lifetime of a k-out-of-n system, then τ k|n is greater than τ k+ 1|n in the hazard rate ordering for any k. This has an interesting interpretation in the language of order statistics. For independent (not necessarily identically distributed) lifetimes T 1, · ··, Tn , we let Tk:n represent the kth order statistic (in increasing order). Then it is shown that Tk + 1:n is greater than Tk:n in the hazard rate ordering for all k = 1, ···, n − 1. The result does not, however, extend to the stronger likelihood ratio order.

In a recent paper, van Doorn (1991) explained how quasi-stationary distributions for an absorbing birth-death process could be determined from the transition rates of the process, thus generalizing earlier work of Cavender (1978). In this paper we shall show that many of van Doorn's results can be extended to deal with an arbitrary continuous-time Markov chain over a countable state space, consisting of an irreducible class, C, and an absorbing state, 0, which is accessible from C. Some of our results are extensions of theorems proved for honest chains in Pollett and Vere-Jones (1992).In Section 3 we prove that a probability distribution on C is a quasi-stationary distribution if and only if it is a µ-invariant measure for the transition function, P. We shall also show that if m is a quasi-stationary distribution for P, then a necessary and sufficient condition for m to be µ-invariant for Q is that P satisfies the Kolmogorov forward equations over C. When the remaining forward equations hold, the quasi-stationary distribution must satisfy a set of ‘residual equations' involving the transition rates into the absorbing state. The residual equations allow us to determine the value of µ for which the quasi-stationary distribution is µ-invariant for P. We also prove some more general results giving bounds on the values of µ for which a convergent measure can be a µ-subinvariant and then µ-invariant measure for P. The remainder of the paper is devoted to the question of when a convergent µ-subinvariant measure, m, for Q is a quasi-stationary distribution. Section 4 establishes a necessary and sufficient condition for m to be a quasi-stationary distribution for the minimal chain. In Section 5 we consider ‘single-exit' chains. We derive a necessary and sufficient condition for there to exist a process for which m is a quasi-stationary distribution. Under this condition all such processes can be specified explicitly through their resolvents. The results proved here allow us to conclude that the bounds for µ obtained in Section 3 are, in fact, tight. Finally, in Section 6, we illustrate our results by way of two examples: regular birth-death processes and a pure-birth process with absorption.

Let X 1, X 2, · ·· be independent and identically distributed random variables such that ΕΧ 1 < 0 and P (X 1 ≥ 0) ≥ 0. Fix M ≥ 0 and let T = inf {n: X 1 + X 2 + · ·· + Xn ≥ M} (T = +∞, if for every n = 1,2, ···). In this paper we consider the estimation of the level-crossing probabilities P (T , by using Monte Carlo simulation and especially importance sampling techniques. When using importance sampling, precision and efficiency of the estimation depend crucially on the choice of the simulation distribution. For this choice we introduce a new criterion which is of the type of large deviations theory; consequently, the basic large deviations theory is the main mathematical tool of this paper. We allow a wide class of possible simulation distributions and, considering the case that M →∞, we prove asymptotic optimality results for the simulation of the probabilities P (T <∞) and . The paper ends with an example.

Let S be the sum-of-digits function in base 2, which returns the number of 1s in the base-2 expansion of a nonnegative integer. For a nonnegative integer t, define the asymptotic density $${c_t} = \mathop {\lim }\limits_{N \to \infty } {1 \over N}|\{ 0 \le n < N:s(n + t) \ge s(n)\} |.$$ T. W. Cusick conjectured that ct > 1/2. We have the elementary bound 0 < ct < 1; however, no bound of the form 0 < α ≤ ct or ct ≤ β < 1, valid for all t, is known. In this paper, we prove that ct > 1/2 – ε as soon as t contains sufficiently many blocks of 1s in its binary expansion. In the proof, we provide estimates for the moments of an associated probability distribution; this extends the study initiated by Emme and Prikhod’ko (2017) and pursued by Emme and Hubert (2018).

Some favourite topics of both mathematics teachers and mathematics students are the golden ratio, Fibonacci numbers, groups, and Pythagorean triples. The material of this paper involves the first three, and there are some analogies with the fourth.

We work in the smooth category. Let $N$ be a closed connected orientable 4-manifold with torsion free $H_1$, where $H_q := H_q(N; \mathbb Z)$. Our main result is a readily calculable classification of embeddings $N\to\mathbb R^7$ up to isotopy, with an indeterminancy. Such a classification was only known before for $H_1=0$ by our earlier work from 2008. Our classification is complete when $H_2=0$ or when the signature of $N$ is divisible neither by 64 nor by 9. The group of knots $S^4\to\mathbb R^7$ acts on the set of embeddings $N\to\mathbb R^7$ up to isotopy by embedded connected sum. In Part I we classified the quotient of this action. The main novelty of this paper is the description of this action for $H_1\ne0$, with an indeterminancy. Besides the invariants of Part I, detecting the action of knots involves a refinement of the Kreck invariant from our work of 2008. For $N=S^1\times S^3$ we give a geometrically defined 1--1 correspondence between the set of isotopy classes of embeddings and a certain explicitly defined quotient of the set $\mathbb Z\oplus\mathbb Z\oplus\mathbb Z_{12}$., Comment: 19 pages, exposition improved

A graph $\Gamma $ is called $(G, s)$ -arc-transitive if $G \le \text{Aut} (\Gamma )$ is transitive on the set of vertices of $\Gamma $ and the set of s-arcs of $\Gamma $ , where for an integer $s \ge 1$ an s-arc of $\Gamma $ is a sequence of $s+1$ vertices $(v_0,v_1,\ldots ,v_s)$ of $\Gamma $ such that $v_{i-1}$ and $v_i$ are adjacent for $1 \le i \le s$ and $v_{i-1}\ne v_{i+1}$ for $1 \le i \le s-1$ . A graph $\Gamma $ is called 2-transitive if it is $(\text{Aut} (\Gamma ), 2)$ -arc-transitive but not $(\text{Aut} (\Gamma ), 3)$ -arc-transitive. A Cayley graph $\Gamma $ of a group G is called normal if G is normal in $\text{Aut} (\Gamma )$ and nonnormal otherwise. Fang et al. [‘On edge transitive Cayley graphs of valency four’, European J. Combin.25 (2004), 1103–1116] proved that if $\Gamma $ is a tetravalent 2-transitive Cayley graph of a finite simple group G, then either $\Gamma $ is normal or G is one of the groups $\text{PSL}_2(11)$ , ${\rm M} _{11}$ , $\text{M} _{23}$ and $A_{11}$ . However, it was unknown whether $\Gamma $ is normal when G is one of these four groups. We answer this question by proving that among these four groups only $\text{M} _{11}$ produces connected tetravalent 2-transitive nonnormal Cayley graphs. We prove further that there are exactly two such graphs which are nonisomorphic and both are determined in the paper. As a consequence, the automorphism group of any connected tetravalent 2-transitive Cayley graph of any finite simple group is determined.

In [5], the author proved that the Gauss map of a nonflat complete minimal surface immersed in R3 can omit at most four points of the sphere, and in [7] he revealed some relations between this result and the defect relation in Nevanlinna theory on value distribution of meromorphic functions. Afterwards, Mo and Osserman obtained an improvement of these results in their paper [11], which asserts that if the Gauss map of a nonflat complete minimal surface M immersed in R3 takes on five distinct values only a finite number of times, then M has finite total curvature. The author also gave modified defect relations for holomorphic maps of a Riemann surface with a complete conformai metric into the n-dimensional complex projective space Pn(C) and, as its application, he showed that, if the (generalized) Gauss map G of a complete minimal surface M immersed in Rm is nondegenerate, namely, the image G(M) is not contained in any hyperplane in Pm − 1(C), then it can omit at most m(m + 1)/2 hyperplanes in general position ([8]). Here, the number m(m + 1)/2 is best-possible for arbitrary odd numbers and some small even numbers m (see [6]). Recently, Ru showed that the “nondegenerate” assumption of the above result can be dropped ([13]). In this paper, we shall introduce a new definition of modified defect and prove a refined Modified defect relation. As its application, we shall give some improvements of the above-mentioned results in [5], [7], [8], [11] and [13].