for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> COMPUTER SCIENCE (Total: 1985 journals)
    - ANIMATION AND SIMULATION (29 journals)
    - AUTOMATION AND ROBOTICS (98 journals)
    - COMPUTER ARCHITECTURE (9 journals)
    - COMPUTER ENGINEERING (9 journals)
    - COMPUTER GAMES (16 journals)
    - COMPUTER PROGRAMMING (23 journals)
    - COMPUTER SCIENCE (1153 journals)
    - COMPUTER SECURITY (45 journals)
    - DATA BASE MANAGEMENT (13 journals)
    - DATA MINING (32 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (27 journals)
    - IMAGE AND VIDEO PROCESSING (40 journals)
    - INFORMATION SYSTEMS (104 journals)
    - INTERNET (92 journals)
    - SOCIAL WEB (50 journals)
    - SOFTWARE (33 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1153 journals)                  1 2 3 4 5 6 | Last

Showing 1 - 200 of 872 Journals sorted alphabetically
3D Printing and Additive Manufacturing     Full-text available via subscription   (Followers: 12)
Abakós     Open Access   (Followers: 3)
Academy of Information and Management Sciences Journal     Full-text available via subscription   (Followers: 67)
ACM Computing Surveys     Hybrid Journal   (Followers: 23)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 8)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 13)
ACM Transactions on Accessible Computing (TACCESS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 16)
ACM Transactions on Applied Perception (TAP)     Hybrid Journal   (Followers: 6)
ACM Transactions on Architecture and Code Optimization (TACO)     Hybrid Journal   (Followers: 9)
ACM Transactions on Autonomous and Adaptive Systems (TAAS)     Hybrid Journal   (Followers: 7)
ACM Transactions on Computation Theory (TOCT)     Hybrid Journal   (Followers: 11)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 4)
ACM Transactions on Computer Systems (TOCS)     Hybrid Journal   (Followers: 18)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 12)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 3)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 1)
ACM Transactions on Economics and Computation     Hybrid Journal  
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 20)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 9)
ACM Transactions on Interactive Intelligent Systems (TiiS)     Hybrid Journal   (Followers: 4)
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)     Hybrid Journal   (Followers: 10)
ACM Transactions on Reconfigurable Technology and Systems (TRETS)     Hybrid Journal   (Followers: 7)
ACM Transactions on Sensor Networks (TOSN)     Hybrid Journal   (Followers: 8)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 11)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 21)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 3)
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Ad Hoc Networks     Hybrid Journal   (Followers: 11)
Adaptive Behavior     Hybrid Journal   (Followers: 11)
Advanced Engineering Materials     Hybrid Journal   (Followers: 26)
Advanced Science Letters     Full-text available via subscription   (Followers: 7)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 8)
Advances in Artificial Intelligence     Open Access   (Followers: 15)
Advances in Artificial Neural Systems     Open Access   (Followers: 4)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 15)
Advances in Computer Science : an International Journal     Open Access   (Followers: 13)
Advances in Computing     Open Access   (Followers: 3)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 53)
Advances in Engineering Software     Hybrid Journal   (Followers: 25)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 10)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 25)
Advances in Human-Computer Interaction     Open Access   (Followers: 19)
Advances in Materials Sciences     Open Access   (Followers: 16)
Advances in Operations Research     Open Access   (Followers: 11)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Remote Sensing     Open Access   (Followers: 37)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Advances in Technology Innovation     Open Access  
AEU - International Journal of Electronics and Communications     Hybrid Journal   (Followers: 8)
African Journal of Information and Communication     Open Access   (Followers: 6)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
Air, Soil & Water Research     Open Access   (Followers: 7)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 6)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1)
Algorithms     Open Access   (Followers: 10)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 3)
American Journal of Computational Mathematics     Open Access   (Followers: 4)
American Journal of Information Systems     Open Access   (Followers: 6)
American Journal of Sensor Technology     Open Access   (Followers: 2)
Anais da Academia Brasileira de Ciências     Open Access   (Followers: 2)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 5)
Analysis in Theory and Applications     Hybrid Journal  
Animation Practice, Process & Production     Hybrid Journal   (Followers: 5)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 8)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 6)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of Software Engineering     Hybrid Journal   (Followers: 12)
Annual Reviews in Control     Hybrid Journal   (Followers: 6)
Anuario Americanista Europeo     Open Access  
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applied and Computational Harmonic Analysis     Full-text available via subscription   (Followers: 2)
Applied Artificial Intelligence: An International Journal     Hybrid Journal   (Followers: 14)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Clinical Informatics     Hybrid Journal   (Followers: 1)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 12)
Applied Computer Systems     Open Access   (Followers: 1)
Applied Informatics     Open Access  
Applied Mathematics and Computation     Hybrid Journal   (Followers: 32)
Applied Medical Informatics     Open Access   (Followers: 10)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Soft Computing     Hybrid Journal   (Followers: 16)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 4)
Architectural Theory Review     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4)
Archive of Numerical Software     Open Access  
Archives and Museum Informatics     Hybrid Journal   (Followers: 120)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4)
Artifact     Hybrid Journal   (Followers: 2)
Artificial Life     Hybrid Journal   (Followers: 5)
Asia Pacific Journal on Computational Engineering     Open Access  
Asia-Pacific Journal of Information Technology and Multimedia     Open Access   (Followers: 1)
Asian Journal of Computer Science and Information Technology     Open Access  
Asian Journal of Control     Hybrid Journal  
Assembly Automation     Hybrid Journal   (Followers: 2)
at - Automatisierungstechnik     Hybrid Journal   (Followers: 1)
Australian Educational Computing     Open Access  
Automatic Control and Computer Sciences     Hybrid Journal   (Followers: 3)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Automatica     Hybrid Journal   (Followers: 9)
Automation in Construction     Hybrid Journal   (Followers: 6)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 8)
Basin Research     Hybrid Journal   (Followers: 4)
Behaviour & Information Technology     Hybrid Journal   (Followers: 52)
Bioinformatics     Hybrid Journal   (Followers: 293)
Biomedical Engineering     Hybrid Journal   (Followers: 16)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 17)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 32)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 45)
British Journal of Educational Technology     Hybrid Journal   (Followers: 119)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 10)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 2)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal  
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 13)
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal  
Cell Communication and Signaling     Open Access   (Followers: 1)
Central European Journal of Computer Science     Hybrid Journal   (Followers: 5)
CERN IdeaSquare Journal of Experimental Innovation     Open Access  
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chemometrics and Intelligent Laboratory Systems     Hybrid Journal   (Followers: 15)
ChemSusChem     Hybrid Journal   (Followers: 7)
China Communications     Full-text available via subscription   (Followers: 7)
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
CIN Computers Informatics Nursing     Full-text available via subscription   (Followers: 12)
Circuits and Systems     Open Access   (Followers: 16)
Clean Air Journal     Full-text available via subscription   (Followers: 2)
CLEI Electronic Journal     Open Access  
Clin-Alert     Hybrid Journal   (Followers: 1)
Cluster Computing     Hybrid Journal   (Followers: 1)
Cognitive Computation     Hybrid Journal   (Followers: 4)
COMBINATORICA     Hybrid Journal  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 13)
Communication Methods and Measures     Hybrid Journal   (Followers: 11)
Communication Theory     Hybrid Journal   (Followers: 19)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Algebra     Hybrid Journal   (Followers: 3)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 53)
Communications of the Association for Information Systems     Open Access   (Followers: 18)
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering     Hybrid Journal   (Followers: 3)
Complex & Intelligent Systems     Open Access  
Complex Adaptive Systems Modeling     Open Access  
Complex Analysis and Operator Theory     Hybrid Journal   (Followers: 2)
Complexity     Hybrid Journal   (Followers: 6)
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 9)
Computación y Sistemas     Open Access  
Computation     Open Access  
Computational and Applied Mathematics     Hybrid Journal   (Followers: 2)
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational and Structural Biotechnology Journal     Open Access   (Followers: 2)
Computational and Theoretical Chemistry     Hybrid Journal   (Followers: 9)
Computational Astrophysics and Cosmology     Open Access   (Followers: 1)
Computational Biology and Chemistry     Hybrid Journal   (Followers: 12)
Computational Chemistry     Open Access   (Followers: 2)
Computational Cognitive Science     Open Access   (Followers: 1)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Condensed Matter     Open Access  
Computational Ecology and Software     Open Access   (Followers: 8)
Computational Economics     Hybrid Journal   (Followers: 9)
Computational Geosciences     Hybrid Journal   (Followers: 13)
Computational Linguistics     Open Access   (Followers: 23)
Computational Management Science     Hybrid Journal  
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 4)
Computational Methods and Function Theory     Hybrid Journal  
Computational Molecular Bioscience     Open Access   (Followers: 2)
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computational Particle Mechanics     Hybrid Journal   (Followers: 1)
Computational Research     Open Access   (Followers: 1)
Computational Science and Discovery     Full-text available via subscription   (Followers: 2)
Computational Science and Techniques     Open Access  
Computational Statistics     Hybrid Journal   (Followers: 13)
Computational Statistics & Data Analysis     Hybrid Journal   (Followers: 28)
Computer     Full-text available via subscription   (Followers: 83)
Computer Aided Surgery     Hybrid Journal   (Followers: 3)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 6)
Computer Communications     Hybrid Journal   (Followers: 10)
Computer Engineering and Applications Journal     Open Access   (Followers: 5)
Computer Journal     Hybrid Journal   (Followers: 7)
Computer Methods in Applied Mechanics and Engineering     Hybrid Journal   (Followers: 22)
Computer Methods in Biomechanics and Biomedical Engineering     Hybrid Journal   (Followers: 10)
Computer Methods in the Geosciences     Full-text available via subscription   (Followers: 1)
Computer Music Journal     Hybrid Journal   (Followers: 14)
Computer Physics Communications     Hybrid Journal   (Followers: 6)
Computer Science - Research and Development     Hybrid Journal   (Followers: 7)
Computer Science and Engineering     Open Access   (Followers: 17)
Computer Science and Information Technology     Open Access   (Followers: 11)
Computer Science Education     Hybrid Journal   (Followers: 12)
Computer Science Journal     Open Access   (Followers: 20)

        1 2 3 4 5 6 | Last

  [SJR: 1.296]   [H-I: 38]   [0 followers]  Follow
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1439-6912 - ISSN (Online) 0209-9683
   Published by Springer-Verlag Homepage  [2355 journals]
  • A quantitative Doignon-Bell-Scarf theorem
    • Authors: Iskander Aliev; Robert Bassett; Jesús A. De Loera; Quentin Louveaux
      Pages: 313 - 332
      Abstract: The famous Doignon-Bell-Scarf theorem is a Helly-type result about the existence of integer solutions to systems of linear inequalities. The purpose of this paper is to present the following quantitative generalization: Given an integer k, we prove that there exists a constant c(n,k), depending only on the dimension n and k, such that if a polyhedron {x∈R n : Ax≤b} contains exactly k integer points, then there exists a subset of the rows, of cardinality no more than c(n,k), defining a polyhedron that contains exactly the same k integer points. In this case c(n,0)=2 n as in the original case of Doignon-Bell-Scarf for infeasible systems of inequalities. We work on both upper and lower bounds for the constant c(n,k) and discuss some consequences, including a Clarkson-style algorithm to find the l-th best solution of an integer program with respect to the ordering induced by the objective function.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-015-3266-9
      Issue No: Vol. 37, No. 3 (2017)
  • On the scaling limit of finite vertex transitive graphs with large
    • Authors: Itai Benjamini; Hilary Finucane; Romain Tessera
      Pages: 333 - 374
      Abstract: Let (X n ) be an unbounded sequence of finite, connected, vertex transitive graphs such that X n =O(diam(X n ) q ) for some q>0. We show that up to taking a subsequence, and after rescaling by the diameter, the sequence (X n ) converges in the Gromov Hausdorff distance to some finite dimensional torus equipped with some invariant Finsler metric. The proof relies on a recent quantitative version of Gromov’s theorem on groups with polynomial growth obtained by Breuillard, Green and Tao. If X n is only roughly transitive and X n =O diam(X n δ ) for δ >1 sufficiently small, we prove, this time by elementary means, that (X n ) converges to a circle.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-015-2975-4
      Issue No: Vol. 37, No. 3 (2017)
  • On the rigidity of the Figueroa replacement in PG (2, q 3 )
    • Authors: Mauro Biliotti; Alessandro Montinaro
      Pages: 375 - 395
      Abstract: Let П0 be a subplane of order q of PG(2,q 3) and let G be the copy of PGL(3,q) preserving П0. The Figueroa plane Fig(q 3) is constructed by replacing some parts of the lines of PG(2,q 3) external to П0 by suitable q-subgeometries of PG(2,q 3). Moreover, Fig(q 3) inherits G from PG(2,q 3). We show that this is the unique replacement for the external lines to П0 yielding a projective plane of order q 3 admitting G as a collineation group.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-015-3337-y
      Issue No: Vol. 37, No. 3 (2017)
  • Warning’s Second Theorem with restricted variables
    • Authors: Pete L. Clark; Aden Forrow; John R. Schmitt
      Pages: 397 - 417
      Abstract: We present a restricted variable generalization of Warning’s Second Theorem (a result giving a lower bound on the number of solutions of a low degree polynomial system over a finite field, assuming one solution exists). This is analogous to Schauz-Brink’s restricted variable generalization of Chevalley’s Theorem (a result giving conditions for a low degree polynomial system not to have exactly one solution). Just as Warning’s Second Theorem implies Chevalley’s Theorem, our result implies Schauz-Brink’s Theorem. We include several combinatorial applications, enough to show that we have a general tool for obtaining quantitative refinements of combinatorial existence theorems. Let q = p ℓ be a power of a prime number p, and let F q be “the” finite field of order q. For a 1,...,a n , N∈Z+, we denote by m(a 1,...,a n ;N)∈Z+ a certain combinatorial quantity defined and computed in Section 2.1.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-015-3267-8
      Issue No: Vol. 37, No. 3 (2017)
  • On the degree of univariate polynomials over the integers
    • Authors: Gil Cohen; Amir Shpilka; Avishay Tal
      Pages: 419 - 464
      Abstract: We study the following problem raised by von zur Gathen and Roche [6]: What is the minimal degree of a nonconstant polynomial f: {0,..., n} → {0,..., m}' Clearly, when m = n the function f(x) = x has degree 1. We prove that when m = n — 1 (i.e. the point {n} is not in the range), it must be the case that deg(f) = n — o(n). This shows an interesting threshold phenomenon. In fact, the same bound on the degree holds even when the image of the polynomial is any (strict) subset of {0,..., n}. Going back to the case m = n, as we noted the function f(x) = x is possible, however, we show that if one excludes all degree 1 polynomials then it must be the case that deg(f) = n — o(n). Moreover, the same conclusion holds even if m=O(n 1.475-ϵ). In other words, there are no polynomials of intermediate degrees that map {0,...,n} to {0,...,m}. Furthermore, we give a meaningful answer when m is a large polynomial, or even exponential, in n. Roughly, we show that if \(m < (_{\,\,\,d}^{n/c} )\) , for some constant c, and d≤2n/15, then either deg(f) ≤ d—1 (e.g., \(f(x) = (_{\,\,\,d - 1}^{x - n/2} )\) is possible) or deg(f) ≥ n/3 - O(dlogn). So, again, no polynomial of intermediate degree exists for such m. We achieve this result by studying a discrete version of the problem of giving a lower bound on the minimal L ∞ norm that a monic polynomial of degree d obtains on the interval [—1,1]. We complement these results by showing that for every integer k = O( \(\sqrt n \) ) there exists a polynomial f: {0,...,n}→{0,...,O(2 k )} of degree n/3-O(k)≤deg(f)≤n-k. Our proofs use a variety of techniques that we believe will find other applications as well. One technique shows how to handle a certain set of diophantine equations by working modulo a well chosen set of primes (i.e., a Boolean cube of primes). Another technique shows how to use lattice theory and Minkowski’s theorem to prove the existence of a polynomial with a somewhat not too high and not too low degree, for example of degree n−Ω(logn) for m=n−1.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-015-2987-0
      Issue No: Vol. 37, No. 3 (2017)
  • Asymptotically optimal k -step nilpotency of quadratic algebras and the
           Fibonacci numbers
    • Authors: Natalia Iyudu; Stanislav Shkarin
      Pages: 465 - 479
      Abstract: It follows from the Golod-Shafarevich theorem that if k ∈ N and R is an associative algebra given by n generators and $$d< \frac{{{n^2}}}{4}{\cos ^{ - 2}}\left( {\frac{\pi }{{k + 1}}} \right)$$ quadratic relations, then R is not k-step nilpotent. We show that the above estimate is asymptotically optimal. Namely, for every k ∈ N, there is a sequence of algebras Rn given by n generators and dn quadratic relations such that R n is k-step nilpotent and $$\mathop {\lim }\limits_{n \to \infty } \frac{{{d_n}}}{{{n^2}}} = \frac{1}{4}{\cos ^{ - 2}}\left( {\frac{\pi }{{k + 1}}} \right)$$ .
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-016-3009-6
      Issue No: Vol. 37, No. 3 (2017)
  • Cycles in triangle-free graphs of large chromatic number
    • Authors: Alexandr Kostochka; Benny Sudakov; Jacques Verstraëte
      Pages: 481 - 494
      Abstract: More than twenty years ago Erdős conjectured [4] that a triangle-free graph G of chromatic number k≥k 0(ε) contains cycles of at least k 2−ε different lengths as k→∞. In this paper, we prove the stronger fact that every triangle-free graph G of chromatic number k≥k 0(ε) contains cycles of 1/64(1 − ε)k 2 logk/4 consecutive lengths, and a cycle of length at least 1/4(1 − ε)k 2logk. As there exist triangle-free graphs of chromatic number k with at most roughly 4k 2 logk vertices for large k, these results are tight up to a constant factor. We also give new lower bounds on the circumference and the number of different cycle lengths for k-chromatic graphs in other monotone classes, in particular, for K r -free graphs and graphs without odd cycles C 2s+1.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-015-3262-0
      Issue No: Vol. 37, No. 3 (2017)
  • Graphs without proper subgraphs of minimum degree 3 and short cycles
    • Authors: Lothar Narins; Alexey Pokrovskiy; Tibor Szabó
      Pages: 495 - 519
      Abstract: We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degree 3. Erdős, Faudree, Gyárfás, and Schelp conjectured that such graphs always have cycles of lengths 3,4,5,...,C(n) for some function C(n) tending to in finity. We disprove this conjecture, resolve a related problem about leaf-to-leaf path lengths in trees, and characterize graphs with n vertices and 2n−2 edges, containing no proper subgraph of minimum degree 3.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-015-3310-9
      Issue No: Vol. 37, No. 3 (2017)
  • An extension of Nathanson’s Theorem on representation functions
    • Authors: Eszter Rozgonyi; Csaba Sándor
      Pages: 521 - 537
      Abstract: For a given integer n and a set S ⊆ N denote by R h,S (1) the number of solutions of the equation \(n = {s_{{i_1}}} + ... + {s_{{i_h}}},{s_{{i_j}}} \in S,j = 1,...,h\) . In this paper we determine all pairs (A;B), A,B ⊆ N for which R h,A (1)(n) = R h,B (1)(n) from a certain point on, where h is a power of a prime. We also discuss the composite case.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-015-3311-8
      Issue No: Vol. 37, No. 3 (2017)
  • Random matrices have simple spectrum
    • Authors: Terence Tao; Van Vu
      Pages: 539 - 553
      Abstract: Let M n =(ξ ij )1≤i,j≤n be a real symmetric random matrix in which the upper-triangular entries ξ ij , i < j and diagonal entries ξ ii are independent. We show that with probability tending to 1, M n has no repeated eigenvalues. As a corollary, we deduce that the Erdős-Rényi random graph has simple spectrum asymptotically almost surely, answering a question of Babai.
      PubDate: 2017-06-01
      DOI: 10.1007/s00493-016-3363-4
      Issue No: Vol. 37, No. 3 (2017)
  • A simple proof of optimal epsilon nets
    • Authors: Nabil H. Mustafa; Kunal Dutta; Arijit Ghosh
      PubDate: 2017-06-14
      DOI: 10.1007/s00493-017-3564-5
  • Inverses of bipartite graphs
    • Authors: Yujun Yang; Dong Ye
      PubDate: 2017-06-13
      DOI: 10.1007/s00493-016-3502-y
  • Local convergence of random graph colorings
    • Authors: Amin Coja-Oghlan; Charilaos Efthymiou; Nor Jaafari
      PubDate: 2017-06-13
      DOI: 10.1007/s00493-016-3394-x
  • Revisiting Kneser’s theorem for field extensions
    • Authors: Christine Bachoc; Oriol Serra; Gilles Zémor
      Abstract: A Theorem of Hou, Leung and Xiang generalised Kneser’s addition Theorem to field extensions. This theorem was known to be valid only in separable extensions, and it was a conjecture of Hou that it should be valid for all extensions. We give an alternative proof of the theorem that also holds in the non-separable case, thus solving Hou’s conjecture. This result is a consequence of a strengthening of Hou et al.’s theorem that is inspired by an addition theorem of Balandraud and is obtained by combinatorial methods transposed and adapted to the extension field setting.
      PubDate: 2017-05-31
      DOI: 10.1007/s00493-016-3529-0
  • Fermat-like equations that are not partition regular
    • Authors: Mauro Di Nasso; Maria Riggio
      Abstract: By means of elementary conditions on coefficients, we isolate a large class of Fermat-like Diophantine equations that are not partition regular, the simplest examples being x n + y m = z k with k ∉ {n, m}.
      PubDate: 2017-05-31
      DOI: 10.1007/s00493-016-3640-2
  • A Cauchy-Davenport theorem for linear maps
    • Authors: Simao Herdade; John Kim; Swastik Koppartyy
      Abstract: We prove a version of the Cauchy-Davenport theorem for general linear maps. For subsets A, B of the finite field \(\mathbb{F}_p \) , the classical Cauchy-Davenport theorem gives a lower bound for the size of the sumset A + B in terms of the sizes of the sets A and B. Our theorem considers a general linear map \(L:\mathbb{F}_p^n \to \mathbb{F}_p^m \) , and subsets \(A_1 , \ldots A_n \subseteq \mathbb{F}_p\) , and gives a lower bound on the size of L(A 1 × A 2 × … × A n ) in terms of the sizes of the sets A 1, …, A n . Our proof uses Alon’s Combinatorial Nullstellensatz and a variation of the polynomial method.
      PubDate: 2017-05-31
      DOI: 10.1007/s00493-016-3486-7
  • Accessibility in transitive graphs
    • Authors: Matthias Hamann
      Abstract: We prove that the cut space of any transitive graph G is a finitely generated Aut(G)-module if the same is true for its cycle space. This confirms a conjecture of Diestel which says that every locally finite transitive graph whose cycle space is generated by cycles of bounded length is accessible. In addition, it implies Dunwoody’s conjecture that locally finite hyperbolic transitive graphs are accessible. As a further application, we obtain a combinatorial proof of Dunwoody’s accessibility theorem of finitely presented groups.
      PubDate: 2017-05-31
      DOI: 10.1007/s00493-017-3361-1
  • Resilient hypergraphs with fixed matching number
    • Authors: Peter Frankl
      Abstract: Let H be a hypergraph of rank k, that is, H ≦ k for all H ∈ H. Let ν(H) denote the matching number, the maximum number of pairwise disjoint edges in H. For a vertex x let H(x̄) be the hypergraph consisting of the edges H ∈ H with x ∉ H. If ν(H(x̄)) = ν(H) for all vertices, H is called resilient. The main result is the complete determination of the maximum number of 2-element sets in a resilient hypergraph with matching number s. For k=3 it is \(\left( {\begin{array}{*{20}c} {2s + 1} \\ 2 \\ \end{array} } \right)\) while for k ≧ 4 the formula is \(k \cdot \left( {\begin{array}{*{20}c} {2s + 1} \\ 2 \\ \end{array} } \right)\) . The results are used to obtain a stability theorem for k-uniform hypergraphs with given matching number.
      PubDate: 2017-05-31
      DOI: 10.1007/s00493-016-3579-3
  • The Ramsey numbers for a triple of long cycles
    • Authors: Agnieszka Figaj; Tomasz Łuczak
      Abstract: We find the asymptotic value of the Ramsey number for a triple of long cycles, where the lengths of the cycles are large but may have different parity.
      PubDate: 2017-05-31
      DOI: 10.1007/s00493-016-2433-y
  • A tight lower bound for Szemerédi’s regularity lemma
    • Authors: Jacob Fox; László Miklós Lovász
      Abstract: We determine the order of the tower height for the partition size in a version of Szemerédi’s regularity lemma. This addresses a question of Gowers.
      PubDate: 2017-05-31
      DOI: 10.1007/s00493-016-3274-4
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016