ON A GENERALIZATION OF A THEOREM OF LICHNEROWICZ TO MANIFOLDS WITH BOUNDARY

2011 ◽  
Vol 08 (03) ◽  
pp. 639-646
Author(s):  
PAUL BRACKEN
Keyword(s):  
Lower Bound ◽  
Boundary Conditions ◽  
Lower Bounds ◽  
Closed Manifold ◽  
Manifolds With Boundary ◽  
Different Boundary Conditions ◽  
Nonzero Eigenvalue ◽  
Nonempty Boundary ◽  
Boundary Case

A theorem due to Lichnerowicz which establishes a lower bound on the lowest nonzero eigenvalue of the Laplacian acting on functions on a compact, closed manifold is reviewed. It is shown how this theorem can be extended to the case of a manifold with nonempty boundary. Lower bounds for different boundary conditions, analogous to the empty boundary case, are formulated and some novel proofs are presented.

Topographic waves in open domains. Part 1. Boundary conditions and frequency estimates

1989 ◽  
Vol 200 ◽  
pp. 69-76 ◽  
Author(s):  
E. R. Johnson
Keyword(s):  
Variational Principle ◽  
Lower Bound ◽  
Boundary Conditions ◽  
Lower Bounds ◽  
Mass Flux ◽  
Upper Bound ◽  
Normal Modes ◽  
Upper And Lower Bounds ◽  
Open Boundary ◽  
Depth Gradients

The problem is considered of topographic waves propagating on depth gradients in rotating domains. A variational principle is derived for the eigenfunctions and eigenfrequencies of normal modes on a domain, and applied to subdomains of the whole domain. Considering suitable boundary conditions on the open boundary between the subdomain and the remainder of the whole domain gives upper and lower bounds and estimates for the frequencies of normal modes localized in the subdomain without the complication of solving over the whole domain. It is shown that applying a zero-mass-flux condition at the open boundary leads to a lower bound on the frequency whereas requiring a particular form of the energy flux to vanish identically at each point of the boundary provides an upper bound.

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

scholarly journals A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 164
Author(s):  
Tobias Rupp ◽  
Stefan Funke
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Real World ◽  
Road Network ◽  
Upper And Lower Bounds ◽  
Bounded Degree ◽  
Shortest Path Routing ◽  
Graph Classes ◽  
Speed Up ◽  
To Come

We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family not too far from subgraphs that occur in real-world road networks, in particular, it is planar and has a bounded degree. Additionally, we borrow ideas from our lower bound proof to come up with instance-based lower bounds for concrete road network instances of moderate size, reaching up to 96% of an upper bound given by a constructed CH. For a variant of our instance-based schema applied to some special graph classes, we can even show matching upper and lower bounds.

scholarly journals On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits

2021 ◽  
Vol 13 (3) ◽  
pp. 1-21
Author(s):  
Suryajith Chillara
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Complexity Measure ◽  
Natural Question ◽  
Multilinear Polynomial ◽  
Arithmetic Circuit ◽  
Theory Of Computing ◽  
Small Constant ◽  
Multilinear Polynomials ◽  
The Individual

In this article, we are interested in understanding the complexity of computing multilinear polynomials using depth four circuits in which the polynomial computed at every node has a bound on the individual degree of r ≥ 1 with respect to all its variables (referred to as multi- r -ic circuits). The goal of this study is to make progress towards proving superpolynomial lower bounds for general depth four circuits computing multilinear polynomials, by proving better bounds as the value of r increases. Recently, Kayal, Saha and Tavenas (Theory of Computing, 2018) showed that any depth four arithmetic circuit of bounded individual degree r computing an explicit multilinear polynomial on n O (1) variables and degree d must have size at least ( n / r 1.1 ) Ω(√ d / r ) . This bound, however, deteriorates as the value of r increases. It is a natural question to ask if we can prove a bound that does not deteriorate as the value of r increases, or a bound that holds for a larger regime of r . In this article, we prove a lower bound that does not deteriorate with increasing values of r , albeit for a specific instance of d = d ( n ) but for a wider range of r . Formally, for all large enough integers n and a small constant η, we show that there exists an explicit polynomial on n O (1) variables and degree Θ (log 2 n ) such that any depth four circuit of bounded individual degree r ≤ n η must have size at least exp(Ω(log 2 n )). This improvement is obtained by suitably adapting the complexity measure of Kayal et al. (Theory of Computing, 2018). This adaptation of the measure is inspired by the complexity measure used by Kayal et al. (SIAM J. Computing, 2017).

scholarly journals Mechanics of tubular helical assemblies: ensemble response to axial compression and extension

2021 ◽  
Author(s):  
Jacopo Quaglierini ◽  
Alessandro Lucantonio ◽  
Antonio DeSimone
Keyword(s):  
Boundary Conditions ◽  
Elastic Properties ◽  
Central Region ◽  
Mechanical Response ◽  
Different Boundary Conditions ◽  
Kirchhoff Rods ◽  
Model Versus ◽  
The Individual ◽  
Opposite Chirality

Abstract Nature and technology often adopt structures that can be described as tubular helical assemblies. However, the role and mechanisms of these structures remain elusive. In this paper, we study the mechanical response under compression and extension of a tubular assembly composed of 8 helical Kirchhoff rods, arranged in pairs with opposite chirality and connected by pin joints, both analytically and numerically. We first focus on compression and find that, whereas a single helical rod would buckle, the rods of the assembly deform coherently as stable helical shapes wound around a common axis. Moreover, we investigate the response of the assembly under different boundary conditions, highlighting the emergence of a central region where rods remain circular helices. Secondly, we study the effects of different hypotheses on the elastic properties of rods, i.e., stress-free rods when straight versus when circular helices, Kirchhoff’s rod model versus Sadowsky’s ribbon model. Summing up, our findings highlight the key role of mutual interactions in generating a stable ensemble response that preserves the helical shape of the individual rods, as well as some interesting features, and they shed some light on the reasons why helical shapes in tubular assemblies are so common and persistent in nature and technology. Graphic Abstract We study the mechanical response under compression/extension of an assembly composed of 8 helical rods, pin-jointed and arranged in pairs with opposite chirality. In compression we find that, whereas a single rod buckles (a), the rods of the assembly deform as stable helical shapes (b). We investigate the effect of different boundary conditions and elastic properties on the mechanical response, and find that the deformed geometries exhibit a common central region where rods remain circular helices. Our findings highlight the key role of mutual interactions in the ensemble response and shed some light on the reasons why tubular helical assemblies are so common and persistent.

scholarly journals Lower bounds for the state complexity of probabilistic languages and the language of prime numbers

2020 ◽  
Vol 30 (1) ◽  
pp. 175-192
Author(s):  
NathanaËl Fijalkow
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Prime Numbers ◽  
Regular Languages ◽  
Automata Theory ◽  
Seminal Paper ◽  
Probabilistic Automata ◽  
State Complexity ◽  
Probabilistic Languages ◽  
Alternating Automata

Abstract This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, we consider infinite automata and the notion of state complexity defined by Karp. Motivated by the seminal paper of Rabin from 1963 introducing probabilistic automata, we study the (deterministic) state complexity of probabilistic languages and prove that probabilistic languages can have arbitrarily high deterministic state complexity. We then look at alternating automata as introduced by Chandra, Kozen and Stockmeyer: such machines run independent computations on the word and gather their answers through boolean combinations. We devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique. The first is a hierarchy theorem, stating that there are languages of arbitrarily high polynomial alternating state complexity, and the second is a linear lower bound on the alternating state complexity of the prime numbers written in binary. This second result strengthens a result of Hartmanis and Shank from 1968, which implies an exponentially worse lower bound for the same model.

scholarly journals Encoding Two-Dimensional Range Top-k Queries

Algorithmica ◽  
2021 ◽  
Author(s):  
Seungbum Jo ◽  
Rahul Lingala ◽  
Srinivasa Rao Satti
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Total Order ◽  
Two Dimensional ◽  
Information Theoretic ◽  
Cartesian Tree ◽  
Dimensional Range

AbstractWe consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering $${\text{Top-}}{k}$$ Top- k queries. The aim is to obtain encodings that use space close to the information-theoretic lower bound, which can be constructed efficiently. For an $$m \times n$$ m × n array, with $$m \le n$$ m ≤ n , we first propose an encoding for answering 1-sided $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries, whose query range is restricted to $$[1 \dots m][1 \dots a]$$ [ 1 ⋯ m ] [ 1 ⋯ a ] , for $$1 \le a \le n$$ 1 ≤ a ≤ n . Next, we propose an encoding for answering for the general (4-sided) $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries that takes $$(m\lg {{(k+1)n \atopwithdelims ()n}}+2nm(m-1)+o(n))$$ ( m lg ( k + 1 ) n n + 2 n m ( m - 1 ) + o ( n ) ) bits, which generalizes the joint Cartesian tree of Golin et al. [TCS 2016]. Compared with trivial $$O(nm\lg {n})$$ O ( n m lg n ) -bit encoding, our encoding takes less space when $$m = o(\lg {n})$$ m = o ( lg n ) . In addition to the upper bound results for the encodings, we also give lower bounds on encodings for answering 1 and 4-sided $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries, which show that our upper bound results are almost optimal.

Lower Bounds to the Eigenvalues in One-Dimensional Problems by a Shift in the Weight Function

1970 ◽  
Vol 37 (2) ◽  
pp. 267-270 ◽  
Author(s):  
D. Pnueli
Keyword(s):  
Lower Bound ◽  
Weight Function ◽  
Lower Bounds ◽  
Variational Formulation ◽  
Ritz Method ◽  
The Other ◽  
One Dimensional ◽  
Systematic Shift ◽  
The One ◽  
Detailed Computation

A method is presented to obtain both upper and lower bound to eigenvalues when a variational formulation of the problem exists. The method consists of a systematic shift in the weight function. A detailed procedure is offered for one-dimensional problems, which makes improvement of the bounds possible, and which involves the same order of detailed computation as the Rayleigh-Ritz method. The main contribution of this method is that it yields the “other bound;” i.e., the one which cannot be obtained by the Rayleigh-Ritz method.

Sign in / Sign up

Export Citation Format

Share Document