English
Related papers

Related papers: An optimal construction of Hanf sentences

200 papers

In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…

General Mathematics · Mathematics 2021-06-29 Duggirala Meher Krishna , Duggirala Ravi

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…

cmp-lg · Computer Science 2016-08-31 Mary Dalrymple , Stuart M. Shieber , Fernando C. N. Pereira

We study the boundary behavior of solutions to fractional elliptic equations. As the first result, the isolation of the first eigenvalue of the fractional Lane-Emden equation is proved in the bounded open sets with Wiener regular boundary.…

Analysis of PDEs · Mathematics 2023-04-03 Alireza Ataei , Alireza Tavakoli

We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.

Number Theory · Mathematics 2012-01-13 Anne-Maria Ernvall-Hytönen

We give upper bounds for triples of subsets of a finite group such that the triples of elements that multiply to 1 form a perfect matching. Our bounds are the first to give exponential savings in powers of an arbitrary finite group.…

Combinatorics · Mathematics 2017-02-06 Will Sawin

We study the optimal lower and upper complexity bounds for finding approximate solutions to the composite problem $\min_x\ f(x)+h(Ax-b)$, where $f$ is smooth and $h$ is convex. Given access to the proximal operator of $h$, for strongly…

Optimization and Control · Mathematics 2023-08-15 Zhenyuan Zhu , Fan Chen , Junyu Zhang , Zaiwen Wen

We derive an upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive and negated literals in the formula. For certain subsets of…

Computational Complexity · Computer Science 2018-03-21 Bernd Schuh

We prove that a strongly compact cardinal is an upper bound for a Hanf number for amalgamation, etc. in AECs using both semantic and syntactic methods. To syntactically prove non-disjoint amalgamation, a different presentation theorem than…

Logic · Mathematics 2016-08-23 Will Boney , John Baldwin

In this paper, we survey and refine several results -- some previously established in the literature -- that facilitate the construction of exponential bases on planar domains with explicit control over the associated frame bounds. We apply…

Functional Analysis · Mathematics 2025-05-07 Oleg Asipchuk , Laura De Carli

Using groups with triality we obtain some general multiplication formulas in Moufang loops, construct Moufang extensions of abelian groups, and describe the structure of minimal extensions for finite simple Moufang loops over abelian…

Group Theory · Mathematics 2016-06-22 Alexander N. Grishkov , Andrei V. Zavarnitsine

We show upper and lower bounds for angles in iterations of trisections of certain triangulations.

General Mathematics · Mathematics 2025-05-08 Amalia Adlerteg , Linus Carlsson

In this paper, we study the explicit geometry of threefolds, in particular, Fano varieties. We find an explicitly computable positive integer $N$, such that all but a bounded family of Fano threefolds have $N$-complements. This result has…

Algebraic Geometry · Mathematics 2023-11-14 Caucher Birkar , Jihao Liu

We revisit the classical theory of linear second-order uniformly elliptic equations in divergence form whose solutions have H\"older continuous gradients, and prove versions of the generalized maximum principle, the $C^{1,\alpha}$-estimate,…

Analysis of PDEs · Mathematics 2024-12-10 Boyan Sirakov , Philippe Souplet

Young's integral inequality is complemented with an upper bound to the remainder. The new inequality turns out to be equivalent to Young's inequality, and the cases in which the equality holds become particularly transparent in the new…

General Mathematics · Mathematics 2008-09-11 E. Minguzzi

This article presents an equivalent formulation of the implicit complementarity problem. We demonstrate that solution of the equivalent formulation is equivalent to the solution of the implicit complementarity problem. Moreover, we provide…

Optimization and Control · Mathematics 2023-12-08 Bharat Kumar , Deepmala , A. K. Das

We consider the length of the longest word definable in FO and MSO via a formula of size n. For both logics we obtain as an upper bound for this number an exponential tower of height linear in n. We prove this by counting types with respect…

Logic in Computer Science · Computer Science 2022-02-22 Lauri Hella , Miikka Vilander

We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified…

Logic in Computer Science · Computer Science 2015-01-06 Victor Magron , Xavier Allamigeon , Stéphane Gaubert , Benjamin Werner

For an arbitrary strong, spherically symmetric super-horizon curvature perturbation, we present analytical solutions of the Einstein equations in terms of asymptotic expansion over the ratio of the Hubble radius to the length-scale of the…

General Relativity and Quantum Cosmology · Physics 2012-10-09 A. G. Polnarev , Tomohiro Nakama , Jun'ichi Yokoyama

In the paper we prove a new upper bound for Heilbronn's exponential sum and obtain some applications of our result to distribution of Fermat quotients.

Number Theory · Mathematics 2012-08-31 Ilya D. Shkredov

We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the…

Number Theory · Mathematics 2016-09-23 Kalle Leppälä , Tapani Matala-aho , Topi Törmä
‹ Prev 1 2 3 10 Next ›