English
Related papers

Related papers: Higher arithmetic on the ordinals

200 papers

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…

Optimization and Control · Mathematics 2017-01-03 Raymond Hemmecke , Matthias Köppe , Jon Lee , Robert Weismantel

We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…

Logic · Mathematics 2019-10-31 Lev D. Beklemishev , Fedor N. Pakhomov

We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms,…

Number Theory · Mathematics 2019-08-14 Christian Elsholtz , Christopher Frei

An acute look at \underbar{basic} facts concerning \underbar{unbounded} subnormal operators is taken here. These operators have the richest structure and are the most exciting among the whole family of beneficiaries of the normal ones.…

Functional Analysis · Mathematics 2009-07-01 F. H. Szafraniec

We explore the geometric notion of prolongations in the setting of computational algebra, extending results of Landsberg and Manivel which relate prolongations to equations for secant varieties. We also develop methods for computing…

Commutative Algebra · Mathematics 2008-04-03 Jessica Sidman , Seth Sullivant

We develop a class of algebraic interpretations for many-sorted and higher-order term rewriting systems that takes type information into account. Specifically, base-type terms are mapped to \emph{tuples} of natural numbers and higher-order…

Symbolic Computation · Computer Science 2021-05-05 Deivid Vale , Cynthia Kop

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

Logic · Mathematics 2017-03-17 Jafar S. Eivazloo

We define the concept of a bi-operad. We develop the homotopy theory of "Bital-Sets" and of infinite-bi-operads. We develop a geometry of generalized schemes based on the spectra of distributive monochromatic bi-operads.

Algebraic Topology · Mathematics 2022-04-08 Shai Haran

Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…

Number Theory · Mathematics 2022-03-01 Joseph Burnett , Alex Taylor

Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary…

Combinatorics · Mathematics 2013-05-30 Krasimir Yordzhev

We initiate the study of a natural generalisation of the classical Bochner-Krall problem asking which linear ordinary differential operators possess sequences of eigenpolynomials satisfying linear recurrence relations of finite length; the…

Mathematical Physics · Physics 2024-08-08 Emil Horozov , Boris Shapiro , Milos Tater

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

Number Theory · Mathematics 2017-12-29 Aleksei S. Volostnov

In this note, we construct and study an algebraic system similar to the natural numbers, but with noncommutative addition. The addition we introduce is a binary operation that commutes with itself in the sense of N. Durov. Neverheless, the…

Quantum Algebra · Mathematics 2010-03-11 Tyler Foster

In the article 'Ordinal Logics and the Characterizations of the Informal Concept of Proof', Georg Kreisel poses the problem of assigning unique notations to recursive ordinals, and additionally suggests that the methods which are developed…

Logic · Mathematics 2017-03-17 Matthew Timothy Wright

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

Logic in Computer Science · Computer Science 2025-04-18 Zhibo Chen , Frank Pfenning

Given the congruence lattice L of a finite algebra A with a Mal'cev term, we look for those sequences of operations on L that are sequences of higher commutator operations of expansions of A. The properties of higher commutators proved so…

Rings and Algebras · Mathematics 2012-05-25 Erhard Aichinger , Nebojsa Mudrinski

We introduce and study the number of tilings of unit height rectangles with irrational tiles. We prove that the class of sequences of these numbers coincides with the class of diagonals of N-rational generating functions and a class of…

Combinatorics · Mathematics 2014-08-01 Scott Garrabrant , Igor Pak

In standard construction of hyperrational numbers using an ultrapower we assume that the ultrafilter is selective. It makes possible to assign real value to any finite hyperrational number. So, we can consider hyperrational numbers with…

Logic · Mathematics 2020-04-06 Armen Grigoryants

Improved performance in higher-order spectral density estimation is achieved using a general class of infinite-order kernels. These estimates are asymptotically less biased but with the same order of variance as compared to the classical…

Statistics Theory · Mathematics 2007-06-13 Arthur Berg , Dimitris Politis

Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order…

High Energy Physics - Phenomenology · Physics 2010-05-28 Mathias Wagner , Andrea Walther , Bernd-Jochen Schaefer