Integer Farkas Lemma

2015 ◽  
Vol 17 (01) ◽  
pp. 1540003 ◽  
Author(s):  
R. Chandrasekaran
Keyword(s):  
Nonnegative Integer ◽  
Original System ◽  
Single Equation ◽  
Integer Solution ◽  
Polynomial Algorithms ◽  
Inequality System ◽  
Farkas Lemma ◽  
Single Constraint ◽  
Nonnegative Solutions ◽  
Integer Solutions

Farkas type results are available for solutions to linear systems. These can also include restrictions such as nonnegative solutions or integer solutions. They show that the unsolvability can be reduced to a single constraint that is not solvable and this condition is implied by the original system. Such a result does not exist for integer solution to inequality system because a single inequality is always solvable in integers. But a single equation that does not have nonnegative integer solution exists. We present some cases when polynomial algorithms to find nonnegative integer solutions exist.

scholarly journals A Diophantine equation about polygonal numbers

2021 ◽  
Vol 27 (3) ◽  
pp. 113-118
Author(s):  
Yangcheng Li ◽  
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Nonnegative Integer ◽  
Diophantine Equations ◽  
Integer Solution ◽  
Pell Equation ◽  
Integer Solutions ◽  
Polygonal Numbers ◽  
Alpha Beta

It is well known that the number P_k(x)=\frac{x((k-2)(x-1)+2)}{2} is called the x-th k-gonal number, where x\geq1,k\geq3. Many Diophantine equations about polygonal numbers have been studied. By the theory of Pell equation, we show that if G(k-2)(A(p-2)a^2+2Cab+B(q-2)b^2) is a positive integer but not a perfect square, (2A(p-2)\alpha-(p-4)A + 2C\beta+2D)a + (2B(q-2)\beta-(q-4)B+2C\alpha+2E)b>0, 2G(k-2)\gamma-(k-4)G+2H>0 and the Diophantine equation \[AP_p(x)+BP_q(y)+Cxy+Dx+Ey+F=GP_k(z)+Hz\] has a nonnegative integer solution (\alpha,\beta,\gamma), then it has infinitely many positive integer solutions of the form (at + \alpha,bt + \beta,z), where p, q, k \geq 3 and p,q,k,a,b,t,A,B,G\in\mathbb{Z^+}, C,D,E,F,H\in\mathbb{Z}.

scholarly journals New Results on Vector and Homing Vector Automata

2019 ◽  
Vol 30 (08) ◽  
pp. 1335-1361
Author(s):  
Özlem Salehi ◽  
Abuzer Yakaryılmaz ◽  
A. C. Cem Say
Keyword(s):  
Real Time ◽  
Nonnegative Integer ◽  
Diophantine Equations ◽  
Finite Automata ◽  
Separation Problem ◽  
Integer Solutions ◽  
Homing Vector

We present several new results and connections between various extensions of finite automata through the study of vector automata and homing vector automata. We show that homing vector automata outperform extended finite automata when both are defined over [Formula: see text] integer matrices. We study the string separation problem for vector automata and demonstrate that generalized finite automata with rational entries can separate any pair of strings using only two states. Investigating stateless homing vector automata, we prove that a language is recognized by stateless blind deterministic real-time version of finite automata with multiplication iff it is commutative and its Parikh image is the set of nonnegative integer solutions to a system of linear homogeneous Diophantine equations.

scholarly journals Nonnegative integer solutions of the equationFn

2019 ◽  
Vol 43 (3) ◽  
pp. 1115-1123 ◽  
Author(s):  
Fatih ERDUVAN ◽  
Refik KESKİN
Keyword(s):  
Nonnegative Integer ◽  
Integer Solutions

Integer Solutions of Binomial Coefficients

2016 ◽  
Vol 109 (6) ◽  
pp. 472-475
Author(s):  
Nicholas J. Gilbertson
Keyword(s):  
Integer Solution ◽  
Binomial Coefficients ◽  
Underlying Structure ◽  
Integer Solutions

Context and underlying structure explain why the formula for binomial coefficients always produces an integer solution

Solutions for a Class of the Exponential Diophantine Equation

2013 ◽  
Vol 753-755 ◽  
pp. 3149-3152
Author(s):  
Yin Xia Ran
Keyword(s):  
Number Theory ◽  
Algebraic Number ◽  
Diophantine Equation ◽  
Integer Solution ◽  
Algebraic Number Theory ◽  
Necessary Condition ◽  
Exponential Diophantine Equation ◽  
Elementary Method ◽  
Integer Solutions

We studied the Diophantine equation x2+4n=y11. By using the elementary method and algebraic number theory, we obtain the following conclusions: (i) Let x be an odd number, one necessary condition which the equation has integer solutions is that 210n-1/11 contains some square factors. (ii) Let x be an even number, when n=11k(k≥1), all integer solutions for the equation are(x,y)=(0,4k) ; whenn=11k+5(k≥0) , all integer solutions are(x,y)=(±211k+5,22k+1); when n≡1,2,3,4,6,7,8,9,10 the equation has no integer solution.

scholarly journals Top Coefficients of the Denumerant

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Velleda Baldoni ◽  
Nicole Berline ◽  
Brandon Dutra ◽  
Matthias Köppe ◽  
Michele Vergne ◽  
...  
Keyword(s):  
Nonnegative Integer ◽  
Fixed Number ◽  
Lattice Points ◽  
Combinatorial Number Theory ◽  
International Audience ◽  
Integer Solutions ◽  
Combinatorial Function ◽  
Rational Generating Function ◽  
Rational Generating Functions ◽  
The Right

International audience For a given sequence $\alpha = [\alpha_1,\alpha_2,\ldots , \alpha_N, \alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\alpha)(t)$ that counts the nonnegative integer solutions of the equation $\alpha_1x_1+\alpha_2 x_2+ \ldots+ \alpha_Nx_N+ \alpha_{N+1}x_{N+1}=t$, where the right-hand side $t$ is a varying nonnegative integer. It is well-known that $E(\alpha)(t)$ is a quasipolynomial function of $t$ of degree $N$. In combinatorial number theory this function is known as the $\textit{denumerant}$. Our main result is a new algorithm that, for every fixed number $k$, computes in polynomial time the highest $k+1$ coefficients of the quasi-polynomial $E(\alpha)(t)$ as step polynomials of $t$. Our algorithm is a consequence of a nice poset structure on the poles of the associated rational generating function for $E(\alpha)(t)$ and the geometric reinterpretation of some rational generating functions in terms of lattice points in polyhedral cones. Experiments using a $\texttt{MAPLE}$ implementation will be posted separately. Considérons une liste $\alpha = [\alpha_1,\alpha_2,\ldots , \alpha_N, \alpha_{N+1}]$ de $N+1$ entiers positifs. Le dénumérant $E(\alpha)(t)$ est lafonction qui compte le nombre de solutions en entiers positifs ou nuls de l’équation $\sum^{N+1}_{i=1}x_i\alpha_i=t$, où $t$ varie dans les entiers positifs ou nuls. Il est bien connu que cette fonction est une fonction quasi-polynomiale de $t$, de degré $N$. Nous donnons un nouvel algorithme qui calcule, pour chaque entier fixé $k$ (mais $N$ n’est pas fixé, les $k+1$ plus hauts coefficients du quasi-polynôme $E(\alpha)(t)$ en termes de fonctions en dents de scie. Notre algorithme utilise la structure d’ensemble partiellement ordonné des pôles de la fonction génératrice de $E(\alpha)(t)$. Les $k+1$ plus hauts coefficients se calculent à l’aide de fonctions génératrices de points entiers dans des cônes polyèdraux de dimension inférieure ou égale à $k$.

scholarly journals Introduction to Diophantine Approximation. Part II

2017 ◽  
Vol 25 (4) ◽  
pp. 283-288
Author(s):  
Yasushige Watase
Keyword(s):  
Diophantine Approximation ◽  
Irrational Number ◽  
Basic Result ◽  
Formal Proof ◽  
Integer Solution ◽  
Linear Forms ◽  
Diophantine Approximations ◽  
Integer Solutions ◽  
System 1 ◽  
Hurwitz Theorem

SummaryIn the article we present in the Mizar system [1], [2] the formalized proofs for Hurwitz’ theorem [4, 1891] and Minkowski’s theorem [5]. Both theorems are well explained as a basic result of the theory of Diophantine approximations appeared in [3], [6]. A formal proof of Dirichlet’s theorem, namely an inequation |θ−y/x| ≤ 1/x2has infinitely many integer solutions (x, y) where θ is an irrational number, was given in [8]. A finer approximation is given by Hurwitz’ theorem: |θ− y/x|≤ 1/√5x2. Minkowski’s theorem concerns an inequation of a product of non-homogeneous binary linear forms such that |a1x + b1y + c1| · |a2x + b2y + c2| ≤ ∆/4 where ∆ = |a1b2− a2b1| ≠ 0, has at least one integer solution.

scholarly journals Universal mixed sums of generalized 4- and 8-gonal numbers

2019 ◽  
Vol 16 (03) ◽  
pp. 603-627
Author(s):  
Jangwon Ju ◽  
Byeong-Kweon Oh
Keyword(s):  
Nonnegative Integer ◽  
Integer Solution ◽  
Sum Formula ◽  
Positive Integers

An integer of the form [Formula: see text] for an integer [Formula: see text] is called a generalized [Formula: see text]-gonal number. For positive integers [Formula: see text] and [Formula: see text], a mixed sum [Formula: see text] of generalized [Formula: see text]- and [Formula: see text]-gonal numbers is called universal if [Formula: see text] has an integer solution for every nonnegative integer [Formula: see text]. In this paper, we prove that there are exactly 1271 proper universal mixed sums of generalized [Formula: see text]- and [Formula: see text]-gonal numbers. Furthermore, the “[Formula: see text]-theorem” is proved, which states that an arbitrary mixed sum of generalized [Formula: see text]- and [Formula: see text]-gonal numbers is universal if and only if it represents the integers [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text].

Expressions for rational approximations to square roots of integers using Pell's equation

2019 ◽  
Vol 103 (556) ◽  
pp. 101-110
Author(s):  
Ken Surendran ◽  
Desarazu Krishna Babu
Keyword(s):  
Positive Integer ◽  
Continued Fractions ◽  
Integer Solution ◽  
Rational Approximations ◽  
Positive Integer Solution ◽  
Pell’S Equation ◽  
Square Roots ◽  
Integer Solutions

There are recursive expressions (see [1]) for sequentially generating the integer solutions to Pell's equation:p2 −Dq2 = 1, whereDis any positive non-square integer. With known positive integer solutionp1 andq1 we can compute, using these recursive expressions,pnandqnfor alln> 1. See Table in [2] for a list of smallest integer, orfundamental, solutionsp1 andq1 forD≤ 128. These (pn,qn) pairs also formrational approximationstothat, as noted in [3, Chapter 3], match with convergents (Cn=pn/qn) of the Regular Continued Fractions (RCF, continued fractions with the numerator of all fractions equal to 1) for.

Sign in / Sign up

Export Citation Format

Share Document