相关论文: Irrational Base Counting

The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the "essential" or "representative" rules. We revisit the algorithm given by Kryszkiewicz…

We study the Cantor real base numeration system which is a common generalization of two positional systems, namely the Cantor system with a sequence of integer bases and the R\'enyi system with one real base. We focus on the so-called…

In this paper, we propose a Bregman frame for several classical alternating minimization algorithms. In the frame, these algorithms have uniform mathematical formulation. We also present convergence analysis for the frame algorithm. Under…

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…

One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing…

A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…

Terminological knowledge representation systems (TKRSs) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). We analyze from a theoretical point of view a TKRS whose…

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

We study, with the help of a computer program, the Polish Algorithm for finite terms satisfying various algebraic laws, e.g., left distributivity a(bc) = (ab)(ac). While the termination of the algorithm for left distributivity remains open…

An algorithm counting the number of ones in a binary word is presented running in time $O(\log\log b)$ where $b$ is the number of ones. The operations available include bit-wise logical operations and multiplication.

In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…

We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…

In this paper, we introduce an iterative numerical method to solve systems of nonlinear equations. The third-order convergence of this method is analyzed. Several examples are given to illustrate the efficiency of the proposed method.

In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…

We prove in this article the well posedness of non - linear Ordinary Differential Equations (ODE) of first and second order in Orlicz spaces with unbounded domain of definition.

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras…

We obtain a new characterization for irrational numbers of constant type -- defined as irrationals with bounded partial quotients in their continued fraction expansion. The result is essential in the formulation of stability criteria for…

An integer program (IP) with a finite number of feasible solutions may have an unbounded linear programming relaxation if it contains irrational parameters, due to implicit constraints enforced by the irrational numbers. We show that those…

For the solution of full-rank ill-posed linear systems a new approach based on the Arnoldi algorithm is presented. Working with regularized systems, the method theoretically reconstructs the true solution by means of the computation of a…