Artículos (Matemática Aplicada I)
Recent Submissions
-
Article
A Modelling Study on Tsunami Propagation in the Caspian Sea
(Springer, 2019)A numerical model that simulates the propagation of tsunamis produced by submarine earthquakes was applied to the Caspian ...
-
Article
The dimension of a graph
(Elsevier, 2007)For each graph G the dimension of G is defined as the smallest dimension in the Euclidean Space where there is an embedding ...
-
Article
Tutte uniqueness of locally grid graphs
(Departamento de Matemáticas CINVESTAV, 2004)A graph is said to be locally grid if the structure around each of its vertices is a 3 × 3 grid. As a follow up of the ...
-
Article
Homomorphisms and polynomial invariants of graphs
(Elsevier, 2009)This paper initiates a general study of the connection between graph homomorphisms and the Tutte polynomial. This connection ...
-
Article
On the Ramsey numbers for stars versus complete graphs
(Elsevier, 2010)For graphs G1, . . . , Gs, the multicolor Ramsey number R(G1, . . . , Gs) is the smallest integer r such that if we give ...
-
Article
Zero-sum balanced binary sequences
(University of West Georgia, 2007)F whic or h ev is ery p balanced, ositive in i.e., teger whose n ≡ 0 asso mod ciated 4, we Steinhaus construct ...
-
Article
Weak Schur numbers and the search for G.W. Walker’s lost partitions
(Elsevier, 2012)A set A of integers is weakly sum-free if it contains no three distinct elements x, y, z such that x + y = z. Given k ≥ ...
-
Article
Modular Schur numbers
(Electronic Journal of Combinatorics, 2013)For any positive integers l and m, a set of integers is said to be (weakly) l-sum free modulo m if it contains no (pairwise ...
-
Article
On the n-Color Weak Rado Numbers for the Equation x1 + x2 + ··· + xk + c = xk +1
(American Mathematical Society, 2016)For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N, if it exists ...
-
Article
Exact value of 3 color weak Rado number
(Elsevier, 2016)For integers k, n, c with k, n ≥ 1 and c ≥ 0, the n color weak Rado number W Rk(n, c) is defined as the least integer N, ...
-
Article
On the finiteness of some n-color Rado numbers
(Elsevier, 2017)For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N if any, or ...
-
Article
On the degree of regularity of a certain quadratic Diophantine equation
(Elsevier, 2018)We show that, for every positive integer r, there exists an integer b = b(r) such that the 4-variable quadratic Diophantine equation (x1 − y1)(x2 − y2) = b is r-regular. Our proof uses Szemerédi’s theorem on arithmetic progressions.
-
Article
Equation-regular sets and the Fox–Kleitman conjecture
(Elsevier, 2018)Given k ≥ 1, the Fox–Kleitman conjecture from 2006 states that there exists a nonzero integer b such that the 2k-variable ...
-
Article
A general lower bound on the weak Schur number
(Elsevier, 2018)For integers k, n with k, n ≥ 1, the n-color weak Schur number W Sk(n) is defined as the least integer N, such that for ...
-
Article
On the n-Color Weak Rado Numbers for the Equation x1 + x2 + ··· + xk + c = xk +1
(Taylor and Francis, 2019)For integers k, n, c with k, n ≥ 1, and c ≥ 0, the n-color weak Rado number WRk (n, c) is defined as the least integer ...
-
Article
Numerical semigroups of Szemerédi type
(Elsevier, 2019)Given any length k ≥ 3 and density 0 < δ ≤ 1, we introduce and study the set Sz(k, δ) consisting of all positive integers ...
-
Article
3-color Schur numbers
(Elsevier, 2019)Let k ≥ 3 be an integer, the Schur number Sk(3) is the least positive integer, such that for every 3-coloring of the ...
-
Presentation
PURL: A new polynomial-time solvable class of satisfiability
(Universidad de Cádiz, 2007)In this work a new polynomial-time solvable class of satisfiability PURL ( PropUnit RemoveLiterals) is presented, based ...
-
Article
Entanglement in eight-qubit graph states
(Elsevier, 2009)Any 8-qubit graph state belongs to one of the 101 equivalence classes under local unitary operations within the Clifford ...
-
Article
Compact set of invariants characterizing graph states of up to eight qubits
(American Physical Society, 2009)The set of entanglement measures proposed by Hein, Eisert, and Briegel for n-qubit graph states [Phys. Rev. A 69, 062311 ...