Search

We consider the problem of communicating over a channel that randomly “tears” the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length $n$ and pieces of length ${\mathrm{ Geometric}}(p_{n})$ , we characterize the capacity as $C = e^{-\alpha }$ , where $\alpha = \lim _{n\to \infty } p_{n} \log n$ . Our results show that the case of ${\mathrm{ Geometric}}(p_{n})$ -length fragments and the case of deterministic length- $(1/p_{n})$ fragments are qualitatively different and, surprisingly, the capacity of the former is larger. Intuitively, this is due to the fact that, in the random fragments case, large fragments are sometimes observed, which boosts the capacity.

We show that a smooth embedded paper Moebius band must have aspect ratio at least $$\begin{aligned}\lambda _1= \frac{2 \sqrt{4-2 \sqrt{3}}+4}{\root 4 \of {3} \sqrt{2}+2 \sqrt{2 \sqrt{3}-3}} =1.69497\ldots \end{aligned}$$ This bound comes more than 3/4 of the way from the old known bound of $$\pi /2=1.5708\ldots $$ to the conjectured bound of $$\sqrt{3} = 1.732\ldots $$

Sendov’s conjecture states that if all the zeroes of a complex polynomial P(z) of degree at least two lie in the unit disk, then within a unit distance of each zero lies a critical point of P(z). In a paper that appeared in 2014, Degot proved that, for each a ∈ (0, 1), there exists an integer N such that for any polynomial P(z) with degree greater than N, if P(a) = 0 and all zeroes lie inside the unit disk, the disk |z − a| ≤ 1 contains a critical point of P(z). Based on this result, we derive an explicit formula N(a) for each a ∈ (0, 1) and, consequently obtain a uniform bound N for all a ∈ [α, β] where 0 < α < β < 1. This (partially) addresses the questions posed in Degot’s paper.

Wu et al. (Nature 566:378–382, 2019) introduced a new indicator measuring disruption ($${DI}_{1}$$DI1). Bornmann et al. (Do disruption index indicators measure what they propose to measure? The comparison of several indicator variants with assessments by peers, 2019. https://arxiv.org/abs/1911.08775) compared variants of the disruption index and pointed to $${DI}_{5}$$DI5 as an interesting variant. The calculation of a field-specific version of $${DI}_{5}$$DI5 (focusing on disruptiveness within the same field) for Scientometrics papers in the current study reveals that the variant is possibly able to identify landmark papers in scientometrics. This result is in contrast to the Scientometrics analysis previously published by Bornmann and Tekles (Scientometrics 120(1):331–336, 2019) based on the original disruption index ($${DI}_{1}$$DI1).

Cooperation among kin is common in animal societies. Kin groups may form by individuals directly discriminating relatives based on kin recognition cues, or form passively through natal philopatry and limited dispersal. We describe the genetic landscape for a primitively eusocial wasp, Polistes dominula, and ask whether individuals choose cooperative partners that are nearby and/or that are genetic relatives. Firstly, we genotyped an entire sub-population of 1361 wasps and found genetic structuring on an extremely fine scale: the probability of finding genetic relatives decreases exponentially within just a few meters of an individual’s nest. At the same time, however, we found a lack of genetic structuring between natural nest aggregations within the population. Secondly, in a separate dataset where ~2000 wasps were genotyped, we show that wasps forced experimentally to make a new nest choice tended to choose new nests near to their original nests, and that these nests tended to contain some full sisters. However, a significant fraction of wasps chose nests that did not contain sisters, despite sisters being present in nearby nests. Although we cannot rule out a role for direct kin recognition or natal nest-mate recognition, our data suggest that kin groups may form via a philopatric rule-of-thumb, whereby wasps simply select groups and nesting sites that are nearby. The result is that most subordinate helpers obtain indirect fitness benefits by breeding cooperatively.

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a small fraction of the block to transmit the empirical distribution of the state sequence. For error probabilities less than 0.5, it is shown that the second-order rate improves on an existing one based on independent and identically distributed random coding. In the Gaussian case (dirty paper coding) with an almost-sure power constraint, an achievability result is obtained using random coding over the surface of a sphere, and using a small fraction of the block to transmit a quantized description of the state power. It is shown that the second-order asymptotics are identical to the single-user Gaussian channel of the same input power without a state.

Let l be a Banach sequence space with a monotone norm in which the canonical system (e_{n}) is an unconditional basis. We show that if there exists a continuous linear unbounded operator between l-K\"{o}the spaces, then there exists a continuous unbounded quasi-diagonal operator between them. Using this result, we study in terms of corresponding K\"{o}the matrices when every continuous linear operator between l-K\"{o}the spaces is bounded. As an application, we observe that the existence of an unbounded operator between l-K\"{o}the spaces, under a splitting condition, causes the existence of a common basic subspace.

We consider the problem of communicating over a channel that randomly "tears" the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length $n$ and pieces of length ${\rm Geometric}(p_n)$, we characterize the capacity as $C = e^{-\alpha}$, where $\alpha = \lim_{n\to\infty} p_n \log n$. Our results show that the case of ${\rm Geometric}(p_n)$-length fragments and the case of deterministic length-$(1/p_n)$ fragments are qualitatively different and, surprisingly, the capacity of the former is larger. Intuitively, this is due to the fact that, in the random fragments case, large fragments are sometimes observed, which boosts the capacity.

We give common generalizations of the Menon-type identities by Sivaramakrishnan (1969) and Li, Kim, Qiao (2019). Our general identities involve arithmetic functions of several variables, and also contain, as special cases, identities for gcd-sum type functions. We point out a new Menon-type identity concerning the lcm function. We present a simple character free approach for the proof., Comment: 14 pages

O. Einstein (2008) proved Bollob\'as-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker variants., Comment: 6 pages. Improved bound for Theorem 4

The "writing on dirty paper"-channel model offers an information-theoretic framework for precoding techniques for canceling arbitrary interference known at the transmitter. It indicates that lossless precoding is theoretically possible at any signal-to-noise ratio (SNR), and thus dirty-paper coding may serve as a basic building block in both single-user and multiuser communication systems. We design an end-to-end coding realization of a system materializing a significant portion of the promised gains. We employ multidimensional quantization based on trellis shaping at the transmitter. Coset decoding is implemented at the receiver using "virtual bits." Combined with iterative decoding of capacity-approaching codes we achieve an improvement of 2dB over the best scalar quantization scheme. Code design is done using the EXIT chart technique.

This paper again specifies the major points of the article “Do Prime Numbers Obey a Three-Dimensional Double Helix?” [1] which was received on February 16, 2006 by Hadronic Journal. New information has been added and elucidated upon, such as why the numbers 2 and 3 are not considered true prime numbers, and why s in the following formulas for 6s - 1 and for 6s + 1 is really a composite number equal to the sum of two other numbers, suggesting that s is always to be considered as an integer. Other new information is added as well, such as how an engineer in a matter of seconds decomposed a large prime product into its constituent primes using basic software and won a contract for his firm.

In their celebrated paper (Furst et al., Math. Syst. Theory 17(1), 13---27 (12)), Furst, Saxe, and Sipser used random restrictions to reveal the weakness of Boolean circuits of bounded depth, establishing that constant-depth and polynomial-size circuits cannot compute the parity function. Such local restrictions have played important roles and have found many applications in complexity analysis and algorithm design over the past three decades. In this article, we give a brief overview of two intriguing applications of local restrictions: the first one is for the Isomorphism Conjecture and the second one is for moderately exponential time algorithms for the Boolean formula satisfiability problem.

We model the folding of ordinary paper via piecewise isometries R 2 → R 3 . The collection of crease lines and vertices in the unfolded paper is called the crease pattern. Our results generalize the previously known necessity conditions from the more restrictive case of folding paper flat (into R 2 ); if the crease pattern is foldable, then the product (in a non-intuitive order) of the associated rotational matrices is the identity matrix. This condition holds locally in a multiple vertex crease pattern and can be adapted to a global condition. Sufficiency conditions are significantly harder, and are not known except in the two-dimensional single-vertex case.

We analyze the multiauthorship matrix M, defined as the matrix where a cell M (j, @k) denotes the number of times authors with j publications are ranked as the @k^t^h author of an article. We prove that if the distribution of the number of authors per paper follows a power law, then the author rank distribution is approximately equal to this power law (more precisely, equal in Landau's big O sense). We further determine the author rank distribution in the case where authors can be characterized through a seed number; this is the probability of preceding a fixed author in the byline of an article. Such a seed is determined for alphabetical ranking of authors using the standard western alphabet.

This expository paper presents known results on distribution functions g(x) of the sequence of blocks where xn is an increasing sequence of positive integers. Also presents results of the set G(Xn) of all distribution functions g(x). Specially: - continuity of g(x); - connectivity of G(Xn); - singleton of G(Xn); - one-step g(x); - uniform distribution of Xn, n = 1, 2, . . . ; - lower and upper bounds of g(x); - applications to bounds of ; - many examples, e.g., , where pn is the nth prime, is uniformly distributed. The present results have been published by 25 papers of several authors between 2001-2013.

Leonetti proved that whenever $${\mathcal {I}}$$ is an ideal on $${\mathbb {N}}$$ such that there exists an uncountable family of sets that are not in $${\mathcal {I}}$$ with the property that the intersection of any two distinct members of that family is in $${\mathcal {I}}$$ , then the space $$c_{0,{\mathcal {I}}}$$ of sequences in $$\ell _\infty $$ that converge to 0 along $${\mathcal {I}}$$ is not complemented. We provide a shorter proof of a more general fact that the quotient space $$\ell _\infty / c_{0,{\mathcal {I}}}$$ does not even embed into $$\ell _\infty $$ .

In a design research study conducted in Swedish preschool class, children were asked: In how many ways can three toy bears sit in a sofa? In the initial design cycle the children who used pictographic representations seemed to make more systematic solutions with less duplications than children who used iconic representations. A later design cycle involved a digital application that was designed to provide an opportunity to work with pictographic representations on a semi-concrete level. In this paper, we make a comparison of paper and pencil documentation made by children who have used, respective not have used; the digital application. The results indicate that working with the digital application resulted in more systematic paper and pencil documentation with fewer duplications. Titelns "or" är i konferensbidraget genomstruket.

Assume that A and G are finite groups of coprime orders such that A acts on G via automorphisms. Let p be a prime. The following coprime action version of a well-known theorem of Ito about the structure of a minimal non-p-nilpotent groups is proved: if every maximal A-invariant subgroup of G is p-nilpotent, then G is p-soluble. If, moreover, G is not p-nilpotent, then G must be soluble. Some earlier results about coprime action are consequences of this theorem.

The aim of this paper is to discuss the main result in the paper by D.Y. Gao and X. Lu [On the extrema of a nonconvex functional with double-well potential in 1D, Z. Angew. Math. Phys. (2016) 67:62]. More precisely we provide a detailed study of the problem considered in that paper, pointing out the importance of the norm on the space $C^{1}[a,b]$; because no norm (topology) is mentioned on $C^{1}[a,b]$ we look at it as being a subspace of $W^{1,p}(a,b)$ for $p\in [1,\infty]$ endowed with its usual norm. We show that the objective function has not local extrema with the mentioned constraints for $p\in [1,4)$, and has (up to an additive constant) only a local maximizer for $p=\infty$, unlike the conclusion of the main result of the discussed paper where it is mentioned that there are (up to additive constants) two local minimizers and a local maximizer. We also show that the same conclusions are valid for the similar problem treated in the preprint by X. Lu and D.Y. Gao [On the extrema of a nonconvex functional with double-well potential in higher dimensions, arXiv:1607.03995]., 12 pages; in this version we added the forgotten condition $F(x) \ne 0$ for $x\in (a,b)$ on page 3

Generalized paper folding sequences X n and (XpYq) n where X;Y 2 fR;L;U;Dg, and n;p;q2 N with p;q 2 are clas- sied in this paper. We show that all generalized paper folding sequences X n p are classied into one type if we classify generalized paper folding sequences along with the numbers of downwards and upwards. In addition, we investigate the numbers of downwards and upwards in (XpYq) n and prove that all generalized paper fold- ing sequences (XpYq) n are classied into two types.

In this paper, we discuss numbers of downwards and upwards in generalized paper folding sequences. We compute the exact number of downwards and upwards in R n p and (RpRq) n by using the properties of recursive sequences where n;p and q are natural numbers with p 2 and q 2.

We give a simple proof and a multivariable generalization of an identity due to E. Alkan concerning a weighted average of the Ramanujan sums. We deduce identities for other weighted averages of the Ramanujan sums with weights concerning logarithms, values of arithmetic functions for gcd's, the Gamma function, the Bernoulli polynomials, and binomial coefficients., Comment: 8 pages

In 1935, Erdos proved that all natural numbers can be written as a sum of a square of a prime and a square-free number. In 1939, Pillai derived an asymptotic formula for the number of such representations. The mathematical review of Pillai’s paper stated that the proof of the above result contained inaccuracies, thus casting a doubt on the correctness of the paper. In this paper, we re-examine Pillai’s paper and show that his argument was essentially correct. Afterwards, we improve the error term in Pillai’s theorem using the Bombieri–Vinogradov theorem.

We note a simple algebraic proof of Frolkina’s result that [Formula: see text] does not contain uncountably many pairwise disjoint copies of the Möbius band, and of a similar result in higher dimensions.

The main goal of this paper is to present the additional stability results of the following orthogonally additive and orthogonally quadratic functional equation $$f(\frac{x}{2}+y)+f(\frac{x}{2}-y)+f(\frac{x}{2}+z)+f(\frac{x}{2}-z)

Let G = (V,E) be a graph and k be a positive integer. A k-dominating set of G is a subset S ⊆ V such that each vertex in V \S has atleast k neighbors in S. A Roman k-dominating function on G is a functionf : V → {0,1,2} such that every vertex v with f(v) = 0 is adjacent toat least k vertices v 1 ,v 2 ,...,v k with f(v i ) = 2 for i = 1,2,...,k. In thepaper titled “Roman k-domination in graphs” (J. Korean Math. Soc. 46(2009), no. 6, 1309–1318) K. Kammerling and L. Volkmann showed thatfor any graph G with n vertices, γ kR (G) + γ kR (G) ≥ min {2n,4k + 1},and the equality holds if and only if n ≤ 2k or k ≥ 2 and n = 2k + 1or k = 1 and G or G has a vertex of degree n − 1 and its complementhas a vertex of degree n − 2. In this paper we find a counterexampleof Kammerling and Volkmann’s result and then give a correction to theresult. 1. IntroductionLet G = (V,E) be agraphwith vertexset V = V (G) andedge set E = E(G).A k-dominatingsetof G is a subset S ⊆ V such that every vertex in V \S has atleast k neighbors in S. The k-domination numberγ

The archimedean solids Cubus simus (snub cube) and Dodecaedron simum (snub dodecahedron) cannot be constructed by ruler and compass. We explain that for general reasons their vertices can be constructed via paper folding on the faces of a cube, respectively dodecahedron, and we present explicit folding constructions. The construction of the Cubus simus is particularly elegant. We also review and prove the construction rules of the other Archimedean solids., Comment: 13 pages, 12 figures, v2: as published in Geometriae Dedicata

In Variations on a theme in paper folding, Burkard Polster [6] discusses an itera tive construction due to Hilton and Pedersen [3] for approximating any acute rational angle (rational multiple of n radians) to any desired accuracy by folding a strip of paper. Hilton and Pedersen, motivated by the construction of regular polygons and star-polygons, focus on the construction of rational angles. The construction employs a periodic sequence composed of two types of folding moves, guided by number theoretic properties of the angle's fractional representation (in fact, analysis of the construction yields new results in number theory?see [4], [1], and [2]). This note generalizes this construction to any acute angle, rational or irrational. For irrational angles, the number-theoretic prescription must obviously be replaced by something new; we show how to derive the appropriate aperiodic sequence of folding moves, via a connection between the folding construction and a simple dynamical system. Hilton and Pedersen's construction recursively generates a sequence of angles a0, otx, ... by a pair of folding operations on a strip of paper which we term Folds and Switchfolds. The angles ak appear between an edge of the strip and a crease created by folding. The Fold operation generates ak+x by bisecting ak (Figure 1)

The main result in Y. O. Hamidoune's paper ‘Adding distinct congruence classes' (Combin. Probab. Comput.7 (1998) 81–87) is as follows. If S is a generating subset of a cyclic group G such that 0 ∉ S and |S| ⩾ 5, then the number of sums of the subsets of S is at least min(|G|, 2|S|). Unfortunately, the argument of the author, who, sadly, passed away in 2011, relies on a lemma whose proof is incorrect; in fact, the lemma is false for all cyclic groups of even order. In this short note we point out this mistake, correct the proof, and discuss why the main result is actually true for all finite abelian groups.

A bound on the capacity of the causal dirty-paper channel with arbitrary interference and general independent identically distributed additive noise is derived. In particular, it is shown that for the case of Gaussian noise, the capacity is upper bounded by log2(1+SNR/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2) .

Given a convex body $$K$$K, consider the smallest number $$N$$N so that there is a point $$P\in \partial K$$PźźK such that every circle centred at $$P$$P intersects $$\partial K$$źK in at most $$N$$N points. In 1946 Erdźs conjectured that $$N=2$$N=2 for all $$K$$K, but there are convex bodies for which this is not the case. As far as we know there is no known global upper bound. We show that no convex body has $$N=\infty $$N=ź and that there are convex bodies for which $$N = 6$$N=6.

Let H be a Hilbert space and let C be a closed convex nonempty subset of H and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T : C\rightarrow H$$\end{document}T:C→H a non-self nonexpansive mapping. A map \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h : C\rightarrow R$$\end{document}h:C→R defined by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h(x) := \inf \{\lambda \ge 0 : \lambda x+(1-\lambda )Tx \in C \}$$\end{document}h(x):=inf{λ≥0:λx+(1-λ)Tx∈C}. Then, for a fixed \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_0 \in C$$\end{document}x0∈C and for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}{\alpha _0} = \max \left\{ {\frac{1}{2},h({x_0})} \right\}\end{aligned}$$\end{document}α0=max12,h(x0), Krasnoselskii–Mann algorithm is defined by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_{n+1}=\alpha _n+(1-\alpha _n)Tx_n,$$\end{document}xn+1=αn+(1-αn)Txn, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha _{n+1}=\max \{\alpha _n, h(x_{x_{n+1}})\}$$\end{document}αn+1=max{αn,h(xxn+1)}. Recently, Colao and Marino (Fixed Point Theory Appl 2015:39, 2015) have proved both weak and strong convergence theorems when C is a strictly convex set and T is an inward mapping. Meanwhile, they proposed a open question for a countable family of non-self nonexpansive mappings. In this article, authors will give an answer and will prove the further generalized results with the examples to support them.

Let $\alpha:[0,1]\to [0,1]$ be a measurable function. It was proved by P. Marchal \cite{Mar15} that the function $$ \phi^{(\alpha)}(\lambda):=\exp\left[ \int_0^1\frac{\lambda-1}{1+(\lambda-1)x}\,\alpha(x)\,d x \right],\quad \lambda>0 $$ is a special Bernstein function. Marchal used this to construct, on a single probability space, a family of regenerative sets $\mathcal R^{(\alpha)}$ such that $\mathcal{R}^{(\alpha)} \stackrel{\text{law}}{=} \overline{\{S^{(\alpha)}_t:t\geq 0\}}$ ($S^{(\alpha)}$ is the subordinator with Laplace exponent $\phi^{(\alpha)}$) and $\mathcal R^{(\alpha)}\subset \mathcal R^{(\beta)}$ whenever $\alpha\leq\beta$. We give two simple proofs showing that $\phi^{(\alpha)}$ is a complete Bernstein function and extend Marchal's construction to all complete Bernstein functions., Comment: to appear in Electron. Comm. Probab

A record mentioned in the paper by Moree (Abh Math Sem Univ Hamburg 77:109–127, 2007) was recently improved on by Akbary and Scholten. However, the record mentioned was not the then record. The then record, due to Gallot (2004), actually slightly improves on that obtained recently by Akbary and Scholten.

We shall make a slight improvement to a result of p-adic logarithms which gives a nontrivial upper bound for the exponent of p dividing the Fermat quotient x^{p-1}-1., 9 pages, submitted to J. Number Theory

We point out that the proof of Theorem 3.3 of Bagchi and Sastry (2013) contains a serious flaw. Accordingly, this theorem needs to be modified. In consequence, we also have to retract Corollary 3.4, Corollary 3.6 and Theorem 3.8 of Bagchi and Sastry (2013).

In a recent paper of Llibre and Rodriguez (J. Differential Equations 198 (2004) 374–380) it is proved that every configuration of cycles in the plane is realizable (up to homeomorphism) by a polynomial vector field of degree at most 2 ( n + r ) - 1 , where n is the number of cycles and r the number of primary cycles (a cycle C is primary if there are no other cycles contained in the bounded region limited by C ). In this letter we prove the same theorem by using an easier construction but with a greater polynomial bound (the vector field we construct has degree at most 4 n - 1 ). By using the same technique we also construct R 3 polynomial vector fields realizing (up to homeomorphism) any configuration of limit cycles which can be linked and knotted in R 3 . This answers a question of R. Sverdlove.