scholarly journals An Upper Bound for the Size of $s$-Distance Sets in Real Algebraic Sets

10.37236/9712 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Gábor Hegedüs ◽  
Lajos Rónyai
Keyword(s):  
Simple Proof ◽  
Upper Bound ◽  
Quadratic Forms ◽  
Short Proof ◽  
Algebraic Method ◽  
Upper Bounds ◽  
Additive Combinatorics ◽  
Algebraic Sets ◽  
Distance Sets ◽  
Real Quadratic

In a recent paper, Petrov and Pohoata developed a new algebraic method which combines the Croot-Lev-Pach Lemma from additive combinatorics and Sylvester’s Law of Inertia for real quadratic forms. As an application, they gave a simple proof of the Bannai-Bannai-Stanton bound on the size of $s$-distance sets (subsets $\mathcal{A}\subseteq \mathbb{R}^n$ which determine at most $s$ different distances). In this paper we extend their work and prove upper bounds for the size of $s$-distance sets in various real algebraic sets. This way we obtain a novel and short proof for the bound of Delsarte-Goethals-Seidel on spherical s-distance sets and a generalization of a bound by Bannai-Kawasaki-Nitamizu-Sato on $s$-distance sets on unions of spheres. In our arguments we use the method of Petrov and Pohoata together with some Gröbner basis techniques.

Upper Bounds for the Resonance Counting Function of Schrödinger Operators in Odd Dimensions

1998 ◽  
Vol 50 (3) ◽  
pp. 538-546 ◽  
Author(s):  
Richard Froese
Keyword(s):  
Simple Proof ◽  
Schrödinger Operator ◽  
Upper Bound ◽  
Counting Function ◽  
Schrödinger Operators ◽  
Upper Bounds ◽  
Schrodinger Operators ◽  
Schrodinger Operator ◽  
Odd Dimensions

AbstractThe purpose of this note is to provide a simple proof of the sharp polynomial upper bound for the resonance counting function of a Schrödinger operator in odd dimensions. At the same time we generalize the result to the class of superexponentially decreasing potentials.

An upper bound for the breadth of the Jones polynomial

1988 ◽  
Vol 103 (3) ◽  
pp. 451-456 ◽  
Author(s):  
Morwen B. Thistlethwaite
Keyword(s):  
Simple Proof ◽  
Upper Bound ◽  
Recent Article ◽  
Jones Polynomial ◽  
Upper Bounds ◽  
The Other ◽  
Link Diagram ◽  
Kauffman Bracket ◽  
Bracket Polynomial ◽  
Connected Diagram

In the recent article [2], a kind of connected link diagram called adequate was investigated, and it was shown that the Jones polynomial is never trivial for such a diagram. Here, on the other hand, upper bounds are considered for the breadth of the Jones polynomial of an arbitrary connected diagram, thus extending some of the results of [1,4,5]. Also, in Theorem 2 below, a characterization is given of those connected, prime diagrams for which the breadth of the Jones polynomial is one less than the number of crossings; recall from [1,4,5] that the breadth equals the number of crossings if and only if that diagram is reduced alternating. The article is concluded with a simple proof, using the Jones polynomial, of W. Menasco's theorem [3] that a connected, alternating diagram cannot represent a split link. We shall work with the Kauffman bracket polynomial 〈D〉 ∈ Z[A, A−1 of a link diagram D.

scholarly journals A Short Note on Short Pants

2014 ◽  
Vol 57 (4) ◽  
pp. 870-876 ◽  
Author(s):  
Hugo Parlier
Keyword(s):  
Upper Bound ◽  
Short Proof ◽  
Short Note ◽  
Upper Bounds ◽  
Hyperbolic Surface ◽  
Optimal Constants ◽  
Pants Decomposition

AbstractIt is a theorem of Bers that any closed hyperbolic surface admits a pants decomposition consisting of curves of bounded length where the bound only depends on the topology of the surface. The question of the quantification of the optimal constants has been well studied, and the best upper bounds to date are linear in genus, due to a theorem of Buser and Seppälä. The goal of this note is to give a short proof of a linear upper bound that slightly improves the best known bound.

scholarly journals Some remarks on the Zarankiewicz problem

2021 ◽  
pp. 1-7
Author(s):  
DAVID CONLON
Keyword(s):  
Upper Bound ◽  
Algebraic Method ◽  
Zarankiewicz Problem

Abstract The Zarankiewicz problem asks for an estimate on z(m, n; s, t), the largest number of 1’s in an m × n matrix with all entries 0 or 1 containing no s × t submatrix consisting entirely of 1’s. We show that a classical upper bound for z(m, n; s, t) due to Kővári, Sós and Turán is tight up to the constant for a broad range of parameters. The proof relies on a new quantitative variant of the random algebraic method.

Upper bounds on the energy dissipation in turbulent precession

1996 ◽  
Vol 321 ◽  
pp. 335-370 ◽  
Author(s):  
R. R. Kerswell
Keyword(s):  
Experimental Data ◽  
Energy Dissipation ◽  
Viscous Dissipation ◽  
Upper Bound ◽  
Dissipation Rate ◽  
Oblate Spheroid ◽  
Upper Bounds ◽  
Precession Rate ◽  
Long Cylinder

Rigorous upper bounds on the viscous dissipation rate are identified for two commonly studied precessing fluid-filled configurations: an oblate spheroid and a long cylinder. The latter represents an interesting new application of the upper-bounding techniques developed by Howard and Busse. A novel ‘background’ method recently introduced by Doering & Constantin is also used to deduce in both instances an upper bound which is independent of the fluid's viscosity and the forcing precession rate. Experimental data provide some evidence that the observed viscous dissipation rate mirrors this behaviour at sufficiently high precessional forcing. Implications are then discussed for the Earth's precessional response.

scholarly journals The Essential Dimension of Stacks of Parabolic Vector Bundles over Curves

2012 ◽  
Vol 10 (3) ◽  
pp. 455-488 ◽  
Author(s):  
Indranil Biswas ◽  
Ajneet Dhillon ◽  
Nicole Lemire
Keyword(s):  
Lower Bounds ◽  
Upper Bound ◽  
Vector Bundles ◽  
Upper Bounds ◽  
Essential Dimension ◽  
Parabolic Structure ◽  
Moduli Stack

AbstractWe find upper bounds on the essential dimension of the moduli stack of parabolic vector bundles over a curve. When there is no parabolic structure, we improve the known upper bound on the essential dimension of the usual moduli stack. Our calculations also give lower bounds on the essential dimension of the semistable locus inside the moduli stack of vector bundles of rank r and degree d without parabolic structure.

ances and covariances obtained from REML are normally distributed with expectation vector and variance-covariance matrix equal to the fol-low  ing, r  espectiv    ely,   When σˆ > 0.04, let νˆ = δˆ + σˆ + σˆ − 2ωˆ + σˆ − (1 + c (7.6) be an estimate for the (7.3) reference-scaled metric in accordance with FDA Guidance (2001) and using a REML UN model. Then (Patter-son, 2003; Patterson and Jones, 2002b), this estimate is asymptotically normally distributed and unbiased with E[νˆ ] = δ +σ − (1 + c and Var[νˆ ] = 4σ + l + 4l + (1 + c ) (l )+ 2l −2(1+c − 2(1+c +4(1+c −2(1+c . Similarly, for the constant-scaled metric, when σˆ ≤ 0.04, νˆ = δˆ + σˆ + σˆ − 2ωˆ + σˆ − σˆ − 0.04(c ) (7.7) E[νˆ ] = δ +σ − 0.04(c ) Var[νˆ ] = 4σ + l + 4l + 2l − 2l − 4l + 4l − 2l . The required asymptotic upper bound √ of the 90% confidence interval can √ then be calculated as νˆ + 1.645× V̂ ar[νˆ ] or νˆ + 1.645× V̂ ar[νˆ ], where the variances are obtained by ‘plugging in’ the estimated values of the variances and covariances obtained from SAS proc mixed into the formulae for Var[νˆ ] or Var[νˆ ]. The necessary SAS code to do this is given in Appendix B. The output reveals that σˆ = 0.0714 and the upper bound is−0.060 for log(AUC). For log(Cmax), σˆ = 0.1060 and the upper bound is −0.055. As both of these upper bounds are below zero, IBE can be claimed.

2003 ◽  
pp. 367-367
Keyword(s):  
Confidence Interval ◽  
Covariance Matrix ◽  
Upper Bound ◽  
Upper Bounds ◽  
Fda Guidance ◽  
Asymptotic Upper Bound ◽  
Variance Covariance Matrix ◽  
Normally Distributed

scholarly journals Upper bounds on the energy of graphs in terms of matching number

2021 ◽  
pp. 16-16
Author(s):  
Saieed Akbari ◽  
Abdullah Alazemi ◽  
Milica Andjelic
Keyword(s):  
Adjacency Matrix ◽  
Connected Graph ◽  
Short Proof ◽  
Upper Bounds ◽  
Vertex Degree ◽  
Maximum Matching ◽  
Matching Number ◽  
Open Problems

The energy of a graph G, ?(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. The matching number ?(G) is the number of edges in a maximum matching. In this paper, for a connected graph G of order n with largest vertex degree ? ? 6 we present two new upper bounds for the energy of a graph: ?(G) ? (n-1)?? and ?(G) ? 2?(G)??. The latter one improves recently obtained bound ?(G) ? {2?(G)?2?e + 1, if ?e is even; ?(G)(? a + 2?a + ?a-2?a), otherwise, where ?e stands for the largest edge degree and a = 2(?e + 1). We also present a short proof of this result and several open problems.

Models of arithmetic and upper bounds for arithmetic sets

1994 ◽  
Vol 59 (3) ◽  
pp. 977-983 ◽  
Author(s):  
Alistair H. Lachlan ◽  
Robert I. Soare
Keyword(s):  
Upper Bound ◽  
Upper Bounds ◽  
Models Of Arithmetic

AbstractWe settle a question in the literature about degrees of models of true arithmetic and upper bounds for the arithmetic sets. We prove that there is a model of true arithmetic whose degree is not a uniform upper bound for the arithmetic sets. The proof involves two forcing constructions.

A Short Proof of an Interpolation Theorem

1974 ◽  
Vol 17 (1) ◽  
pp. 127-128 ◽  
Author(s):  
Edward Hughes
Keyword(s):  
Half Plane ◽  
Complex Plane ◽  
Simple Proof ◽  
Real Line ◽  
Short Proof ◽  
Interpolation Theorem ◽  
Operator Interpolation ◽  
Upper Half Plane ◽  
Positive Functions ◽  
Class Of Functions

In this note we give a simple proof of an operator-interpolation theorem (Theorem 2) due originally to Donoghue [6], and Lions-Foias [7].Let be the complex plane, the open upper half-plane, the real line, ℛ+ and ℛ- the non-negative and non-positive axes. Denote by the class of positive functions on which extend analytically to —ℛ-, and map into itself. Denote by ’ the class of functions φ such that φ(x1/2)2 is in .

Sign in / Sign up

Export Citation Format

Share Document