Search

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

Very recently, I. Altun, M. Aslantas and H. Sahin [1] introduced the notion of $$p$$ -proximal contractions and surveyed the existence of best proximity points for such class of non-self mappings in metric spaces. In this note we show that this existence result is a straightforward consequence of the same conclusion in fixed point theory.

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

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

We correct some mistakes in the paper “A mass formula for negacyclic codes of length 2k and some good negacyclic codes over $\mathbb {Z}_{4}+u\mathbb {Z}_{4}$ ” (Bandi et al. Cryptogr. Commun. 9, 241–272, 2017).

If $$z\in {\mathbb {C}}$$ and $$1\le n$$ is a natural number then $$\begin{aligned} \sum _{d_1 d_2 =n} (1-z^{p_1})\cdots (1-z^{p_m}) z^{q_1 e_{1}+\cdots +q_i e_{i} }=1, \end{aligned}$$ where $$d_1=p_1^{r_1}\dots p_m^{r_m }$$ , $$d_2=q_1^{e_1}\dots q_i^{e_i }$$ are the prime decompositions of $$d_1, d_2$$ . This is one of the identities involving arithmetic functions that we prove using ideas from the paper of Dressler and van de Lune [3].

Very recently Bordelles, Dai, Heyman, Pan and Shparlinski studied asymptotic behaviour of the quantity $$\begin{aligned} S_f(x) := \sum _{n\leqslant x} f\left( \left[ \frac{x}{n}\right] \right) , \end{aligned}$$and established some asymptotic formulas for $$S_f(x)$$ under three different types of assumptions on f. In this short note we improve some of their results.

The main result of this paper states that if $${\mathcal {F}}$$ is a subgroup-closed saturated formation of full characteristic, then the $${\mathcal {F}}$$ -residual of a K- $${\mathcal {F}}$$ -subnormal subgroup S of a finite group G is a large subgroup of G provided that the $${\mathcal {F}}$$ -hypercentre of every subgroup X of G containing S is contained in the $${\mathcal {F}}$$ -residual of X. This extends a recent result of Aivazidis, Safonova and Skiba.

We study the problem of transmitting a message over a channel that randomly breaks the message block into small fragments, deletes a subset of them, and shuffles the remaining fragments. We characterize the capacity of the binary torn-paper channel under arbitrary fragment length distribution and fragment deletion probabilities. We show that, for a message with block length $n$ , discarding fragments shorter than $\log(n)$ does not affect the achievable rates, and that the capacity is given by a simple closed-form expression that can be understood as “coverage minus reordering-cost”.

Recently, metapopulation models for rock-paper-scissors games have been presented. Each subpopulation is represented by a node on a graph. An individual is either rock (R), scissors (S) or paper (P); it randomly migrates among subpopulations. In the present paper, we assume victory rates differ in different subpopulations. To investigate the dynamic state of each subpopulation (node), we numerically obtain the solutions of reaction-diffusion equations on the graphs with two and three nodes. In the case of homogeneous victory rates, we find each subpopulation has a periodic solution with neutral stability. However, when victory rates between subpopulations are heterogeneous, the solution approaches stable focuses. The heterogeneity of victory rates promotes the coexistence of species.

Thamarai Selvi and Vaidya Nathan [2] discussed maximum distance on graphs. We made an extension of that paper [2]. We discussed about complete graph Kn, star graph Sn, the complete bipartite graph Km,n. In this paper, we studied about the cycle graph Cn (n being any interger ≥ 3) and the multi star graph Bm,n, where m, n are integers, both greater than or equal to 2.

The problem of chasing convex functions is easy to state: faced with a sequence of convex functions f t over d-dimensional Euclidean spaces, the goal of the algorithm is to output a point x t at each time, so that the sum of the function costs f t (x t ), plus the movement costs ||x t − x t − 1 || is minimized. This problem generalizes questions in online algorithms such as caching and the k-server problem. In 1994, Friedman and Linial posed the question of getting an algorithm with a competitive ratio that depends only on the dimension d. In this talk we give an O (d)-competitive algorithm, based on the notion of the Steiner point of a convex body.

This paper aims at presenting pairs of rectangles representing the same sphenic number where, in each pair, the sum of the areas is 2 times sphenic number -1

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.

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

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.

In this short paper, we look into a conclusion drawn by Alzalg (J Optim Theory Appl 169:32---49, 2016). We think the conclusion drawn in the paper is incorrect by pointing out three things. First, we provide a counterexample that the proposed inner product does not satisfy bilinearity. Secondly, we offer an argument why a pth-order cone cannot be self-dual under any reasonable inner product structure on $$\mathbb {R}^n$$Rn. Thirdly, even under the assumption that all elements operator commute, the inner product becomes an official inner product and the arbitrary-order cone can be shown as a symmetric cone, we think this condition is still unreasonable and very stringent so that the result can only be applied to very few cases.

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.

Let a(n) be the Fourier coefficient of a holomorphic cusp form on some discrete subgroup of \(SL_2({\mathbb R})\). This note is to refine a recent result of Hofmann and Kohnen on the non-positive (resp. non-negative) product of \(a(n)a(n+r)\) for a fixed positive integer r.

We consider the problem of constructing a matching in an n-nodes graph in a distributed and self-stabilizing manner. We prove that there exists a lower bound in space of \(\varOmega (n\log n)\) bits for universal maximal matching algorithms, and a lower bound in time of \(\varOmega (e)\) moves for universal and cautious 1-maximal matching algorithms. A side contribution of our result is the optimality in both time and space of the self-stabilizing 1-maximal matching algorithm of Inoue et al. [8].

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.

We present a silent self-stabilizing distributed algorithm computing a maximal p-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most \(12\varDelta m + \mathcal {O}(m+n)\) moves, where m is the number of edges, n is the number of nodes, and \(\varDelta \) is the maximum node degree. Regarding the move complexity, our algorithm outperforms the previously known best algorithm by a factor of \(\varDelta \). While the round complexity for the previous algorithm was unknown, we show a \(5\left\lfloor \frac{n}{p+1} \right\rfloor +5\) bound for our algorithm.

We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings \(\mathcal K_k\) with bounded multiplicity \(k \ge 2\). However, we show that process-terminating leader election is possible in the sub-class \(\mathcal U^* \cap \mathcal K_k\), where \(\mathcal U^*\) is the class of rings which contain a process with a unique label.

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.

Recently C.-K. Li and F. Zhang gave a short proof of S.W. Drury’s result that the trace norm preserves positive semidefiniteness of 3 ×3 partitioned positive semidefinite matrices. Slightly generalizing Li and Zhang’s proof we obtain a more general result under the assumption that all matrices on the principal diagonal are of the same size. Also, we answer a question asked by Marcus and Watkins in 1971.

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

We correct an error in the Multiple Point Formula (7.3) in the paper mentioned in the title. This correction propagates to formulas (7.5), (7.6), (7.23) and (8.18), and it affects minor results in Section 8, where few statements require an extra assumption, but it does not affect the main results of Section 8.

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

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

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

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.

For a connected graph G and a vertex v in G , let d G ( v ) , e G ( v ) and D G ( v ) be the degree, eccentricity and distance sum of v , respectively. The eccentric connectivity index of G , denoted by ξ c ( G ) , is defined to be ξ c ( G ) = ∑ v ∈ V ( G ) d G ( v ) e G ( v ) , and the eccentric distance sum of G , denoted by ξ d ( G ) , is defined to be ξ d ( G ) = ∑ v ∈ V ( G ) e G ( v ) D G ( v ) . Denote by G n 2 the set of connected graphs of order n and diameter two. More recently, Zhang et al. (2019) investigated the relationship between the eccentric connectivity index and eccentric distance sum, and posed the problem to determine sharp upper and lower bounds on ξ c ( G ) ξ d ( G ) for graph in G n 2 . In this short paper, we solve this problem. Sharp upper and lower bounds on ξ c ( G ) ξ d ( G ) for graph in G n 2 are determined, and the corresponding extremal graphs are characterized as well.

It is proved that the coordination sequence of the graph obtained from a crystal is of quasi-polynomial type, as had been postulated by Grosse-Kunstleve et al. [Acta Cryst. (1996), A52, 879–889] in their study of coordination sequences of zeolites., The coordination sequence of a graph measures how many vertices the graph has at each distance from a fixed vertex and is a generalization of the coordination number. Here it is proved that the coordination sequence of the graph obtained from a crystal is of quasi-polynomial type, as had been postulated by Grosse-Kunstleve et al. [Acta Cryst. (1996), A52, 879–889].

We characterize one-dimensional Euclidean preference profiles with a small number of alternatives and voters. We show that every single-peaked preference profile withtwovoters is one-dimensional Euclidean, and that every preference profile with up to five alternatives is one-dimensional Euclidean if and only if it is both single-peaked and single-crossing. By the work of Chen et al. (Social Choice and Welfare 48(2):409–432, 2017), we thus obtain that the smallest single-peaked and single-crossing preference profiles that arenotone-dimensional Euclidean consist of three voters and six alternatives.

A well known observation of Lov\'asz is that if a hypergraph is not $2$-colorable, then at least one pair of its edges intersect at a single vertex. %This very simple criterion turned out to be extremly useful . In this short paper we consider the quantitative version of Lov\'asz's criterion. That is, we ask how many pairs of edges intersecting at a single vertex, should belong to a non $2$-colorable $n$-uniform hypergraph? Our main result is an {\em exact} answer to this question, which further characterizes all the extremal hypergraphs. The proof combines Bollob\'as's two families theorem with Pluhar's randomized coloring algorithm., Comment: A note on Property B

In this short paper, we derive an alternative proof for some known (van den Berg & Gilkey 2015) short-time asymptotics of the heat content in a compact full-dimensional submanifolds S with smooth boundary. This includes formulae like $$\begin{aligned} \int _{S} \exp (t\Delta ) (f \mathbb {1}_{S}) \,\mathrm {d}V= \int _S f \,\mathrm {d}V- \sqrt{\frac{t}{\pi }} \int _{\partial S} f \,\mathrm {d}A+ o(\sqrt{t}),\quad t \rightarrow 0^+, \end{aligned}$$ ∫ S exp ( t Δ ) ( f 1 S ) d V = ∫ S f d V - t π ∫ ∂ S f d A + o ( t ) , t → 0 + , and explicit expressions for similar expansions involving other powers of $$\sqrt{t}$$ t . By the same method, we also obtain short-time asymptotics of $$\int _S \exp (t^m\Delta ^m)(f \mathbb {1}_S)\,\mathrm {d}V$$ ∫ S exp ( t m Δ m ) ( f 1 S ) d V , $$m \in \mathbb N$$ m ∈ N , and more generally for one-parameter families of operators $$t \mapsto k(\sqrt{-t\Delta })$$ t ↦ k ( - t Δ ) defined by an even Schwartz function k.

Congruences mod p for a prime p and partial products of the numbers 1,…, p − 1 are obtained. Bibliography: 2 titles.

In Vukicevic and Stevanovic (2013), Theorem 2 is erroneous when m = 3 k + 1 for some integer k . The correct one is given now. That is, P I ( G ) ≥ m 2 − 3 m + 2 when m = 3 k + 1 for some integer k , where G is a connected bicyclic graph with m edges.