scholarly journals On the zeros of a class of generalised Dirichlet series-VIII

1991 ◽  
Vol Volume 14 ◽  
Author(s):  
R Balasubramanian ◽  
K Ramachandra
Keyword(s):  
Lower Bound ◽  
Dirichlet Series ◽  
Number Of Zeros ◽  
International Audience

International audience In an earlier paper (Part VII, with the same title as the present paper) we proved results on the lower bound for the number of zeros of generalised Dirichlet series $F(s)= \sum_{n=1}^{\infty} a_n\lambda^{-s}_n$ in regions of the type $\sigma\geq\frac{1}{2}-c/\log\log T$. In the present paper, the assumptions on the function $F(s)$ are more restrictive but the conclusions about the zeros are stronger in two respects: the lower bound for $\sigma$ can be taken closer to $\frac{1}{2}-C(\log\log T)^{\frac{3}{2}}(\log T)^{-\frac{1}{2}}$ and the lower bound for the number of zeros is something like $T/\log\log T$ instead of the earlier bound $>\!\!\!>T^{1-\varepsilon}$.

scholarly journals On the zeros of a class of generalised Dirichlet series-IX

1991 ◽  
Vol Volume 14 ◽  
Author(s):  
R Balasubramanian ◽  
K Ramachandra
Keyword(s):  
Lower Bound ◽  
Dirichlet Series ◽  
Number Of Zeros ◽  
International Audience

International audience In the present paper, the assumptions on the function $F(s)$ are more restrictive but the conclusions about the zeros are stronger in two respects: the lower bound for $\sigma$ can be taken closer to $\frac{1}{2}-C(\log\log T)(\log T)^{-1}$ and the lower bound for the number of zeros is like $T/\log\log\log T$.

scholarly journals Proof of some conjectures on the mean-value of Titchmarsh series I.

1990 ◽  
Vol Volume 13 ◽  
Author(s):  
R Balasubramanian ◽  
K Ramachandra
Keyword(s):  
Lower Bound ◽  
Dirichlet Series ◽  
Mean Value ◽  
International Audience ◽  
The Mean

International audience Let $F(s)$ be a Titchmarsh series, i.e. a kind of Dirichlet series, the coefficients of which are suitably bounded. This notion was introduced by us in an earlier paper where we stated a conjecture and proved certain theorems on the lower bound for $\int_0^H \vert F(it)\vert^k\,dt$, where $k=1$ or $2$. In this paper, better results and a proof of the conjecture are obtained.

scholarly journals On Greedy Trie Execution

2012 ◽  
Vol DMTCS Proceedings vol. AQ,... (Proceedings) ◽  
Author(s):  
Zbigniew Gołębiewski ◽  
Filip Zagórski
Keyword(s):  
Lower Bound ◽  
Greedy Algorithm ◽  
International Audience ◽  
The Greedy Algorithm

International audience In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping <underline>fair</underline> coins, where recursively, the 0-party (those who i.e. have tossed heads) continues until the leader is chosen. We give an answer to the question stated in the Prodinger's paper – what happens if not a 0-party is recursively looking for a leader but always a party with a smaller cardinality. We show the lower bound on the number of rounds of the greedy algorithm (for <underline>fair</underline> coin).

scholarly journals The lower bound of number of solutions for the second order nonlinear boundary value problem via the root functions method

2007 ◽  
Vol 57 (2) ◽  
Author(s):  
Peter Somora
Keyword(s):  
Lower Bound ◽  
Boundary Value Problem ◽  
Boundary Value ◽  
Second Order ◽  
Dirichlet Boundary Conditions ◽  
Number Of Solutions ◽  
Root Functions ◽  
Number Of Zeros ◽  
Variational Solutions ◽  
Homogeneous Dirichlet Boundary Conditions

AbstractWe consider a second order nonlinear differential equation with homogeneous Dirichlet boundary conditions. Using the root functions method we prove a relation between the number of zeros of some variational solutions and the number of solutions of our boundary value problem which follows into a lower bound of the number of its solutions.

scholarly journals A note on domino treewidth

1999 ◽  
Vol Vol. 3 no. 4 ◽  
Author(s):  
Hans L. Bodlaender
Keyword(s):  
Lower Bound ◽  
Simple Proof ◽  
Maximum Degree ◽  
International Audience

International audience In [DO95], Ding and Oporowski proved that for every k, and d, there exists a constant c_k,d, such that every graph with treewidth at most k and maximum degree at most d has domino treewidth at most c_k,d. This note gives a new simple proof of this fact, with a better bound for c_k,d, namely (9k+7)d(d+1) -1. It is also shown that a lower bound of Ω (kd) holds: there are graphs with domino treewidth at least 1/12 × kd-1, treewidth at most k, and maximum degree at most d, for many values k and d. The domino treewidth of a tree is at most its maximum degree.

scholarly journals The short toric polynomial

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Gábor Hetyei
Keyword(s):  
Lower Bound ◽  
Reflection Principle ◽  
Lattice Path ◽  
Simple Polytope ◽  
Independent Form ◽  
International Audience ◽  
Bound Theorem ◽  
Lattice Path Enumeration ◽  
Nous Utilisons ◽  
Eulerian Poset

International audience We introduce the short toric polynomial associated to a graded Eulerian poset. This polynomial contains the same information as Stanley's pair of toric polynomials, but allows different algebraic manipulations. Stanley's intertwined recurrence may be replaced by a single recurrence, in which the degree of the discarded terms is independent of the rank. A short toric variant of the formula by Bayer and Ehrenborg, expressing the toric h-vector in terms of the cd-index, may be stated in a rank-independent form, and it may be shown using weighted lattice path enumeration and the reflection principle. We use our techniques to derive a formula expressing the toric h-vector of a dual simplicial Eulerian poset in terms of its f-vector. This formula implies Gessel's formula for the toric h-vector of a cube, and may be used to prove that the nonnegativity of the toric h-vector of a simple polytope is a consequence of the Generalized Lower Bound Theorem holding for simplicial polytopes. Nous introduisons le polynôme torique court associé à un ensemble ordonné Eulérien. Ce polynôme contient la même information que le couple de polynômes toriques de Stanley, mais il permet des manipulations algébriques différentes. La récurrence entrecroisée de Stanley peut être remplacée par une seule récurrence dans laquelle le degré des termes écartés est indépendant du rang. La variante torique courte de la formule de Bayer et Ehrenborg, qui exprime le vecteur torique d'un ensemble ordonné Eulérien en termes de son cd-index, est énoncée sous une forme qui ne dépend pas du rang et qui peut être démontrée en utilisant une énumération des chemins pondérés et le principe de réflexion. Nous utilisons nos techniques pour dériver une formule exprimant le vecteur h-torique d'un ensemble ordonné Eulérien dont le dual est simplicial, en termes de son f-vecteur. Cette formule implique la formule de Gessel pour le vecteur h-torique d'un cube, et elle peut être utilisée pour démontrer que la positivité du vecteur h-torique d'un polytope simple est une conséquence du Théorème de la Borne Inférieure Généralisé appliqué aux polytopes simpliciaux.

scholarly journals Packing Plane Perfect Matchings into a Point Set

2015 ◽  
Vol Vol. 17 no.2 (Graph Theory) ◽  
Author(s):  
Ahmad Biniaz ◽  
Prosenjit Bose ◽  
Anil Maheshwari ◽  
Michiel Smid
Keyword(s):  
Lower Bound ◽  
General Position ◽  
Perfect Matchings ◽  
Point Sets ◽  
Exact Answer ◽  
International Audience ◽  
Point Set

International audience Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? For points in general position we prove the lower bound of &#x230A;log<sub>2</sub>$n$&#x230B;$-1$. For some special configurations of point sets, we give the exact answer. We also consider some restricted variants of this problem.

scholarly journals On Compact Encoding of Pagenumber $k$ Graphs

2008 ◽  
Vol Vol. 10 no. 3 ◽  
Author(s):  
Cyril Gavoille ◽  
Nicolas Hanusse
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Constant Time ◽  
Worst Case ◽  
Encoding Scheme ◽  
Information Theoretic ◽  
Auxiliary Table ◽  
Minimum Number ◽  
International Audience

International audience In this paper we show an information-theoretic lower bound of kn - o(kn) on the minimum number of bits to represent an unlabeled simple connected n-node graph of pagenumber k. This has to be compared with the efficient encoding scheme of Munro and Raman of 2kn + 2m + o(kn+m) bits (m the number of edges), that is 4kn + 2n + o(kn) bits in the worst-case. For m-edge graphs of pagenumber k (with multi-edges and loops), we propose a 2mlog2k + O(m) bits encoding improving the best previous upper bound of Munro and Raman whenever m ≤ 1 / 2kn/log2 k. Actually our scheme applies to k-page embedding containing multi-edge and loops. Moreover, with an auxiliary table of o(m log k) bits, our coding supports (1) the computation of the degree of a node in constant time, (2) adjacency queries with O(logk) queries of type rank, select and match, that is in O(logk *minlogk / loglogm, loglogk) time and (3) the access to δ neighbors in O(δ) runs of select, rank or match;.

scholarly journals Partition-theoretic formulas for arithmetic densities, II

2021 ◽  
Vol Volume 43 - Special... ◽  
Author(s):  
Ken Ono ◽  
Robert Schneider ◽  
Ian Wagner
Keyword(s):  
Dirichlet Series ◽  
First Principles ◽  
Prime Numbers ◽  
Integer Partitions ◽  
Root Of Unity ◽  
International Audience ◽  
Positive Integers ◽  
Limiting Values ◽  
Original Theorem ◽  
Do So

International audience In earlier work generalizing a 1977 theorem of Alladi, the authors proved a partition-theoretic formula to compute arithmetic densities of certain subsets of the positive integers N as limiting values of q-series as q → ζ a root of unity (instead of using the usual Dirichlet series to compute densities), replacing multiplicative structures of N by analogous structures in the integer partitions P. In recent work, Wang obtains a wide generalization of Alladi's original theorem, in which arithmetic densities of subsets of prime numbers are computed as values of Dirichlet series arising from Dirichlet convolutions. Here the authors prove that Wang's extension has a partition-theoretic analogue as well, yielding new q-series density formulas for any subset of N. To do so, we outline a theory of q-series density calculations from first principles, based on a statistic we call the "q-density" of a given subset. This theory in turn yields infinite families of further formulas for arithmetic densities.

scholarly journals Proof of some conjectures on the mean-value of Titchmarsh series-II

1991 ◽  
Vol Volume 14 ◽  
Author(s):  
R Balasubramanian ◽  
K Ramachandra
Keyword(s):  
Dirichlet Series ◽  
Lower Bounds ◽  
Mean Value ◽  
International Audience ◽  
The Mean

International audience In this paper, we give lower bounds for $\int_0^H \vert F(it)\vert^k\,dt$, where $k=1$ or $2$ and $F(s)$ is a Dirichlet series of a certain kind. Since the conditions on $F(s)$ are relaxed, the bounds are somewhat smaller than those obtained previously.

Sign in / Sign up

Export Citation Format

Share Document