Results 61 to 70 of about 983 (218)
Kripke on Gödel Incompleteness
ABSTRACT This paper surveys six of Saul Kripke's highly creative ideas and results on Gödel incompleteness, from when he was an undergraduate to last publications. These include his extension of incompleteness from sentences to predicates, his model‐theoretic proof of incompleteness of arithmetic, his compelling analysis of incompleteness in terms of ...
Daniel Isaacson
wiley +1 more source
Systems of linear diophantine equations [PDF]
This thesis provides an algorithm for finding the general solutions of a given system of linear Diophantine equations. A linear Diophantine equation is a polynomial equation (in any number of unknowns) with degree one and whose solutions in integers are ...
Alvarade, Ulysses R., Tizon, Edwin E.
core
On linear forms with algebraic coefficients and diophantine equations [PDF]
In my paper, [Man. Math. 18 (1976), Satz 1.1] I proved a result on simultaneous diophantine inequalities for p-adic linear forms with algebraic coefficients.
Schlickewei, Hans Peter
core +1 more source
Geometrical Regular Languages and Linear Diophantine Equations [PDF]
International audienceWe present a new method for checking whether a regular language over an arbitrarily large alphabet is semi-geometrical or whether it is geometrical. This method makes use first of the partitioning of the state diagram of the minimal
Dubernard, Jean-Philippe +7 more
core +3 more sources
Generalized free wreath products and their operator algebras
Abstract We develop a new approach on free wreath products, generalizing the constructions of Bichon and of Fima‐Pittau. We show stability properties for certain approximation properties such as exactness, Haagerup property, hyperlinearity, and K‐amenability. We study qualitative properties of the associated von Neumann algebra: factoriality, primeness,
Pierre Fima, Arthur Troupel
wiley +1 more source
Minimal basis of the syzygies module of leading terms
Systems of polynomial equations are one of the most universal mathematical objects. Almost all the problems of cryptographic analysis can be reduced to finding solutions to systems of polynomial equations.
A. V. Sokurov
doaj +1 more source
Multivariate discrete splines and linear Diophantine equations [PDF]
In this paper we investigate the algebraic properties of multivariate discrete splines. It turns out that multivariate discrete splines are closely related to linear diophantine equations. In particular, we use a solvability condition for a system of linear diophantine equations to obtain a necessary and sufficient condition for the integer translates ...
openaire +1 more source
Moderate Deviation Principles for Lacunary Trigonometric Sums
ABSTRACT Classical works of Kac, Salem, and Zygmund, and Erdős and Gál have shown that lacunary trigonometric sums despite their dependency structure behave in various ways like sums of independent and identically distributed random variables. For instance, they satisfy a central limit theorem (CLT) and a law of the iterated logarithm.
Joscha Prochno, Marta Strzelecka
wiley +1 more source
On the exceptional set in Littlewood's discrete conjecture
Abstract We consider a discrete analogue of the well‐known Littlewood conjecture on Diophantine approximations and obtain a strong upper bound for the number of exceptional vectors in this conjecture.
I. D. Shkredov
wiley +1 more source
A Novel Alternative Algorithm for Solving Integer Linear Programming Problems Having Three Variables
In this study, a novel alternative method based on parameterization for solving Integer Linear Programming (ILP) problems having three variables is developed.
Alan Kadriye Simsek
doaj +1 more source

