English
Related papers

Related papers: Extended real number arithmetics via Dedekind cuts

200 papers

In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…

Number Theory · Mathematics 2024-05-14 Julian Rosen , Yoshihiro Takeyama , Koji Tasaka , Shuji Yamamoto

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

Discrete Mathematics · Computer Science 2025-10-03 Antonin Callard , Léo Paviet Salomon , Pascal Vanier

Let $m$ and $n$ be positive integers. For the quantum integer $[n]_q = 1 + q + ... + q^{n-1}$ there is a natural polynomial addition such that $[m]_q \oplus_q [n]_q = [m+n]_q$ and a natural polynomial multiplication such that $[m]_q…

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2009-09-30 Alwen Tiu , Alberto Momigliano

In many everyday categories (sets, spaces, modules, ...) objects can be both added and multiplied. The arithmetic of such objects is a challenge because there is usually no subtraction. We prove a family of cases of the following principle:…

Category Theory · Mathematics 2010-02-04 Marcelo Fiore , Tom Leinster

In this paper we summarize some known facts on slice topology in the quaternionic case, and we deepen some of them by proving new results and discussing some examples. We then show, following [18], how this setting allows us to generalize…

Complex Variables · Mathematics 2024-06-27 X. Dou , M. Jin , G. Ren , I. Sabadini

The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…

General Mathematics · Mathematics 2007-05-23 Ashok Kumar Gupta , Ashok Kumar Mittal

We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…

Number Theory · Mathematics 2026-04-16 Mario Ziller

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

Combinatorics · Mathematics 2016-11-08 David Cushing , G. W. Stagg

We present a modification of the superposition calculus that is meant to generate consequences of sets of first-order axioms. This approach is proven to be sound and deductive-complete in the presence of redundancy elimination rules,…

Logic in Computer Science · Computer Science 2014-07-15 Mnacho Echenim , Nicolas Peltier

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

General Mathematics · Mathematics 2014-12-30 Ramin Zahedi

We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications.…

Number Theory · Mathematics 2007-05-23 Paul E. Gunnells , Robert Sczech

We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea…

Number Theory · Mathematics 2024-04-09 Yichen You

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2010-10-01 Alwen Tiu , Alberto Momigliano

This work presents a formalization of analogy on numbers that relies on generalized means. It is motivated by recent advances in artificial intelligence and applications of machine learning, where the notion of analogy is used to infer…

Artificial Intelligence · Computer Science 2024-07-29 Yves Lepage , Miguel Couceiro

In this article, we establish an improvement of the Cauchy-Schwarz inequality. Let $x, y \in \mathcal{H},$ and let $f: (0,1) \rightarrow \mathbb{R}^+$ be a well-defined function, where $\mathbb{R}^+$ denote the set of all positive real…

Functional Analysis · Mathematics 2024-05-31 Raj Kumar Nayak

In an unbounded plane, straight lines are used extensively for mathematical analysis. They are tools of convenience. However, those with high slope values become unbounded at a faster rate than the independent variable. So, straight lines,…

Machine Learning · Computer Science 2024-12-24 Vijay Prakash S

In \cite{[NE]} we introduce $\alpha$-expansions a real numbers in $(0,1]$, given by \[ \sum_{i=1}^{\infty}(\alpha-1)^{i-1}\alpha^{-(d_{1}+\dots+d_{i})}\] with $\alpha>1$ and $d_{i}\in\mathbb{N}$ and discuss ergodic theoretical and dimension…

Dynamical Systems · Mathematics 2026-03-31 Jörg Neunhäuserer

It is shown that the deformed Macdonald-Ruijsenaars operators can be described as the restrictions on certain affine subvarieties of the usual Macdonald-Ruijsenaars operator in infinite number of variables. The ideals of these varieties are…

Quantum Algebra · Mathematics 2008-02-22 A. N. Sergeev , A. P. Veselov

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler