English
Related papers

Related papers: On Use of an Explicit Congruence Predicate in Boun…

200 papers

This paper is concerned with the numerical approximation of stochastic mechanical systems with nonlinear holonomic constraints. Such systems are described by second order stochastic differential-algebraic equations involving an implicitly…

Probability · Mathematics 2017-09-26 Felix Lindner , Holger Stroot

In the context of the variational bi-complex, we re-explain that irreducible gauge systems define a particular example of a Lie algebroid. This is used to review some recent and not so recent results on gauge, global and asymptotic…

Mathematical Physics · Physics 2015-05-20 Glenn Barnich

We study the properties of a system biorthogonal to a complete and minimal system of exponentials in $L^2(E)$, where $E$ is a finite union of intervals, and show that in the case when $E$ is a union of two or three intervals the…

Complex Variables · Mathematics 2022-07-28 Anton Baranov , Yurii Belov , Alexander Kuznetsov

We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is important for reasoning about structures that use data values…

Logic in Computer Science · Computer Science 2019-12-04 Nadia Labai , Tomer Kotek , Magdalena Ortiz , Helmut Veith

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Tribonacci-automatic". This class includes, for example, the famous Tribonacci word T =…

Formal Languages and Automata Theory · Computer Science 2014-07-29 Hamoon Mousavi , Jeffrey Shallit

We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic ($\sin$-PA), and systematically study decision problems for sets of sentences in $\sin$-PA. In particular, we detail a decision…

Logic · Mathematics 2022-05-03 Eion Blanchard , Philipp Hieronymi

Fix n>2. Let s be a principally embedded sl(2)-subalgebra in sl(n). A special case of results of the second author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite dimensional…

Representation Theory · Mathematics 2016-06-24 Hassan Lhou , Jeb F. Willenbring

We present an explicit evaluation of the double Gauss sum $\displaystyle G(a,b,c;S;p^n):=\sum_{x,y=0}^{p^n-1} e^{2\pi i S(ax^2+bxy+cy^2)/p^n}$, where $a, b, c$ are integers such that $\gcd(a,b,c)=1$, $p$ is a prime, $n$ is a positive…

Number Theory · Mathematics 2016-09-14 Şaban Alaca , Greg Doyle

The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…

Algebraic Geometry · Mathematics 2016-01-20 Thomas Bauer , Sandra Di Rocco , Brian Harbourne , Jack Huizenga , Anders Lundman , Piotr Pokora , Tomasz Szemberg

In this article, we use Pad\'{e} approximations constructed for binomial functions, to give a new upper bound for the number of the solutions of the $S$-unit equation. Combining explicit formulae of these Pad\'{e} approximants with a simple…

Number Theory · Mathematics 2024-06-19 Noriko Hirata-Kohno , Makoto Kawashima , Anthony Poëls , Yukiko Washio

Peano Arithmetic is known to be provably equivalent to reflection over Elementary Arithmetic. We prove a characterization of Predicative Analysis in the guise of ATR0 in terms of stronger reflection principles.

We discuss completeness, minimality, and basisness, in $L^2[0, \pi]$ and $L^p[0, \pi]$, $p \neq 2$, of dilated systems $u_n(x) = S(nx)$, $n \in \mathbb{N}$, where $S$ is a trigonometric polynomial $S(x) = \sum_{k = 0}^m a_k \sin(kx), \quad…

Classical Analysis and ODEs · Mathematics 2016-12-21 Boris Mityagin

Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…

Classical Analysis and ODEs · Mathematics 2007-11-29 Jean-Pierre Kahane , Yitzhak Katznelson

We prove that any incomplete system of complex exponentials $\{e^{i\lambda_n t}\}$ in $L^2(-\pi,\pi)$ is a subset of some complete and minimal system of exponentials. In addition, we prove analogous statement for systems of reproducing…

Complex Variables · Mathematics 2014-09-16 Yurii Belov

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

Logic in Computer Science · Computer Science 2021-08-24 Johannes Marti

BEE is a compiler which facilitates solving finite domain constraints by encoding them to CNF and applying an underlying SAT solver. In BEE constraints are modeled as Boolean functions which propagate information about equalities between…

Programming Languages · Computer Science 2013-08-20 Michael Codish , Yoav Fekete , Amit Metodi

Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the…

Category Theory · Mathematics 2007-05-23 K. Dosen , Z. Petric

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

Classical Analysis and ODEs · Mathematics 2024-07-01 Trevor D. Wooley

In this paper we propose an all-in-one statement which includes existence, uniqueness, regularity, and numerical approximations of mild solutions for a class of stochastic partial differential equations (SPDEs) with non-globally monotone…

Probability · Mathematics 2024-12-20 Sara Mazzonetto , Diyora Salimova

For a wide class of polynomially nonlinear systems of partial differential equations we suggest an algorithmic approach to the s(trong)-consistency analysis of their finite difference approximations on Cartesian grids. First we apply the…

Symbolic Computation · Computer Science 2019-05-01 Vladimir P. Gerdt , Daniel Robertz