English
Related papers

Related papers: Considering The Satisfiability of Cubic Diophantin…

200 papers

A K3 surface over a number field has infinitely many rational points over a finite field extension. For K3 surfaces of degree 2, arising as double covers of $\mathbb{P}^2$ branched along a smooth sextic curve, we give a bound for the degree…

Number Theory · Mathematics 2025-10-16 Júlia Martínez-Marín

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

Computational Complexity · Computer Science 2018-03-19 Chi-Ning Chou , Mrinal Kumar , Noam Solomon

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Commutative Algebra · Mathematics 2023-09-18 Ada Boralevi , Jasper van Doornmalen , Jan Draisma , Michiel E. Hochstenbach , Bor Plestenjak

We study, in three parts, degree sequences of k-families (or k-uniform hypergraphs) and shifted k-families. The first part collects for the first time in one place, various implications such as: Threshold implies Uniquely Realizable implies…

Combinatorics · Mathematics 2008-01-11 Caroline Klivans , Victor Reiner

The Zariski closure of the boundary of the set of matrices of nonnegative rank at most 3 is reducible. We give a minimal generating set for the ideal of each irreducible component. In fact, this generating set is a Grobner basis with…

Algebraic Geometry · Mathematics 2014-12-05 Rob H. Eggermont , Emil Horobet , Kaie Kubjas

The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…

Logic in Computer Science · Computer Science 2024-08-07 Daniel Hausmann , Lutz Schröder

We provide two new proofs of a theorem of Cooper, Long and Reid which asserts that, apart from an explicit finite list of exceptional manifolds, any compact orientable irreducible 3-manifold with non-empty boundary has large fundamental…

Geometric Topology · Mathematics 2007-05-23 Marc Lackenby

By considering the general properties of approximate units in differentiable algebras, we are able to present a unified approach to characterising completeness of spectral metric spaces, existence of connections on modules, and the lifting…

Operator Algebras · Mathematics 2016-10-24 Bram Mesland , Adam Rennie

Grothendieck's bound is used in the context of a single quantum system, in contrast to previous work which used it for multipartite entangled systems and the violation of Bell-like inequalities. Roughly speaking the Grothendieck theorem…

Quantum Physics · Physics 2023-05-22 A. Vourdas

We use the ideas of symplectic quantization for quantizing fields in finite volumes. We consider, as examples, the Klein-Gordon and electromagnetic fields in three dif- ferent boxes. As a second idea we consider the given boundary…

High Energy Physics - Theory · Physics 2013-11-05 S. Chenarani , A. Shirzad

Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…

Logic in Computer Science · Computer Science 2017-01-24 Patricia Johann , Kristina Sojakova

By a theorem due to the first author, the bounded derived category of a finite-dimensional algebra over a field embeds fully faithfully into the stable category over its repetitive algebra. This embedding is an equivalence iff the algebra…

Representation Theory · Mathematics 2007-05-23 Dieter Happel , Bernhard Keller , Idun Reiten

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Number Theory · Mathematics 2019-02-12 Gareth Boxall , Gareth Jones , Harry Schmidt

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

Number Theory · Mathematics 2023-08-29 Kalman Gyory , Attila Petho , Laszlo Szalay

For a branched cover between two closed orientable surfaces, the Riemann-Hurwitz formula relates the Euler characteristics of the surfaces, the total degree of the cover, and the total length of the partitions of the degree given by the…

Geometric Topology · Mathematics 2011-01-18 Maria Antonietta Pascali , Carlo Petronio

We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri

We give a criterion for the good reduction of semistable $K3$ surfaces over $p$-adic fields using purely $p$-adic methods. We use neither $p$-adic Hodge theory nor transcendental methods as in the analogous proofs of criteria for good…

Algebraic Geometry · Mathematics 2017-04-18 Genaro Hernandez Mada

The concept of space-bounded computability has become significantly important in handling vast data sets on memory-limited computing devices. To replenish the existing short list of NL-complete problems whose instance sizes are dictated by…

Computational Complexity · Computer Science 2022-06-22 Tomoyuki Yamakami

Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint…

Logic in Computer Science · Computer Science 2014-05-01 Amir M. Ben-Amram , Michael Vainer