for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> MATHEMATICS (Total: 879 journals)
    - APPLIED MATHEMATICS (71 journals)
    - GEOMETRY AND TOPOLOGY (19 journals)
    - MATHEMATICS (651 journals)
    - MATHEMATICS (GENERAL) (42 journals)
    - NUMERICAL ANALYSIS (19 journals)

MATHEMATICS (651 journals)                  1 2 3 4 | Last

Showing 1 - 200 of 538 Journals sorted alphabetically
Abakós     Open Access   (Followers: 3)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 2)
Academic Voices : A Multidisciplinary Journal     Open Access   (Followers: 2)
Accounting Perspectives     Full-text available via subscription   (Followers: 8)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 16)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 4)
ACM Transactions on Mathematical Software (TOMS)     Hybrid Journal   (Followers: 6)
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 21)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 1)
Acta Mathematica     Hybrid Journal   (Followers: 11)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 2)
Acta Mathematica Scientia     Full-text available via subscription   (Followers: 5)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 5)
Acta Mathematica Vietnamica     Hybrid Journal  
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal  
Advanced Science Letters     Full-text available via subscription   (Followers: 7)
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 3)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Complex Systems     Hybrid Journal   (Followers: 7)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 15)
Advances in Decision Sciences     Open Access   (Followers: 4)
Advances in Difference Equations     Open Access   (Followers: 1)
Advances in Fixed Point Theory     Open Access   (Followers: 5)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 10)
Advances in Linear Algebra & Matrix Theory     Open Access   (Followers: 1)
Advances in Materials Sciences     Open Access   (Followers: 16)
Advances in Mathematical Physics     Open Access   (Followers: 5)
Advances in Mathematics     Full-text available via subscription   (Followers: 10)
Advances in Numerical Analysis     Open Access   (Followers: 4)
Advances in Operations Research     Open Access   (Followers: 11)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Pure and Applied Mathematics     Hybrid Journal   (Followers: 5)
Advances in Pure Mathematics     Open Access   (Followers: 4)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2)
African Journal of Educational Studies in Mathematics and Sciences     Full-text available via subscription   (Followers: 5)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
Afrika Matematika     Hybrid Journal   (Followers: 1)
Air, Soil & Water Research     Open Access   (Followers: 7)
AKSIOMA Journal of Mathematics Education     Open Access   (Followers: 1)
Algebra and Logic     Hybrid Journal   (Followers: 3)
Algebra Colloquium     Hybrid Journal   (Followers: 4)
Algebra Universalis     Hybrid Journal   (Followers: 2)
Algorithmic Operations Research     Full-text available via subscription   (Followers: 5)
Algorithms     Open Access   (Followers: 11)
Algorithms Research     Open Access   (Followers: 1)
American Journal of Biostatistics     Open Access   (Followers: 9)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 4)
American Journal of Mathematical Analysis     Open Access  
American Journal of Mathematics     Full-text available via subscription   (Followers: 7)
American Journal of Operations Research     Open Access   (Followers: 5)
American Mathematical Monthly     Full-text available via subscription   (Followers: 6)
An International Journal of Optimization and Control: Theories & Applications     Open Access   (Followers: 7)
Analele Universitatii Ovidius Constanta - Seria Matematica     Open Access   (Followers: 1)
Analysis     Hybrid Journal   (Followers: 2)
Analysis and Applications     Hybrid Journal   (Followers: 1)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 3)
Analysis Mathematica     Full-text available via subscription  
Annales Mathematicae Silesianae     Open Access  
Annales mathématiques du Québec     Hybrid Journal   (Followers: 4)
Annales UMCS, Mathematica     Open Access   (Followers: 1)
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica     Open Access  
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 9)
Annals of Discrete Mathematics     Full-text available via subscription   (Followers: 6)
Annals of Mathematics     Full-text available via subscription  
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 6)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of the Alexandru Ioan Cuza University - Mathematics     Open Access  
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1)
Annals of West University of Timisoara - Mathematics     Open Access  
Annuaire du Collège de France     Open Access   (Followers: 5)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applications of Mathematics     Hybrid Journal   (Followers: 1)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 12)
Applied Mathematics     Open Access   (Followers: 3)
Applied Mathematics     Open Access   (Followers: 4)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 4)
Applied Mathematics - A Journal of Chinese Universities     Hybrid Journal  
Applied Mathematics Letters     Full-text available via subscription   (Followers: 1)
Applied Mathematics Research eXpress     Hybrid Journal   (Followers: 1)
Applied Network Science     Open Access  
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 4)
Arab Journal of Mathematical Sciences     Open Access   (Followers: 2)
Arabian Journal of Mathematics     Open Access   (Followers: 2)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 1)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4)
Archive of Numerical Software     Open Access  
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4)
Arkiv för Matematik     Hybrid Journal   (Followers: 1)
Arnold Mathematical Journal     Hybrid Journal   (Followers: 1)
Artificial Satellites : The Journal of Space Research Centre of Polish Academy of Sciences     Open Access   (Followers: 19)
Asia-Pacific Journal of Operational Research     Hybrid Journal   (Followers: 3)
Asian Journal of Algebra     Open Access   (Followers: 1)
Asian Journal of Current Engineering & Maths     Open Access  
Asian-European Journal of Mathematics     Hybrid Journal   (Followers: 2)
Australian Mathematics Teacher, The     Full-text available via subscription   (Followers: 7)
Australian Primary Mathematics Classroom     Full-text available via subscription   (Followers: 2)
Australian Senior Mathematics Journal     Full-text available via subscription   (Followers: 1)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Axioms     Open Access  
Baltic International Yearbook of Cognition, Logic and Communication     Open Access  
Basin Research     Hybrid Journal   (Followers: 5)
BIBECHANA     Open Access  
BIT Numerical Mathematics     Hybrid Journal  
BoEM - Boletim online de Educação Matemática     Open Access  
Boletim Cearense de Educação e História da Matemática     Open Access  
Boletim de Educação Matemática     Open Access  
Boletín de la Sociedad Matemática Mexicana     Hybrid Journal  
Bollettino dell'Unione Matematica Italiana     Full-text available via subscription   (Followers: 1)
British Journal of Mathematical and Statistical Psychology     Full-text available via subscription   (Followers: 21)
Bruno Pini Mathematical Analysis Seminar     Open Access  
Buletinul Academiei de Stiinte a Republicii Moldova. Matematica     Open Access   (Followers: 7)
Bulletin des Sciences Mathamatiques     Full-text available via subscription   (Followers: 4)
Bulletin of Dnipropetrovsk University. Series : Communications in Mathematical Modeling and Differential Equations Theory     Open Access   (Followers: 1)
Bulletin of Mathematical Sciences     Open Access   (Followers: 1)
Bulletin of the Brazilian Mathematical Society, New Series     Hybrid Journal  
Bulletin of the London Mathematical Society     Hybrid Journal   (Followers: 3)
Bulletin of the Malaysian Mathematical Sciences Society     Hybrid Journal  
Calculus of Variations and Partial Differential Equations     Hybrid Journal  
Canadian Journal of Science, Mathematics and Technology Education     Hybrid Journal   (Followers: 18)
Carpathian Mathematical Publications     Open Access   (Followers: 1)
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal  
CHANCE     Hybrid Journal   (Followers: 5)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
ChemSusChem     Hybrid Journal   (Followers: 7)
Chinese Annals of Mathematics, Series B     Hybrid Journal  
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
Chinese Journal of Mathematics     Open Access  
Clean Air Journal     Full-text available via subscription   (Followers: 2)
Cogent Mathematics     Open Access   (Followers: 2)
Cognitive Computation     Hybrid Journal   (Followers: 4)
Collectanea Mathematica     Hybrid Journal  
College Mathematics Journal     Full-text available via subscription   (Followers: 2)
COMBINATORICA     Hybrid Journal  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 13)
Commentarii Mathematici Helvetici     Hybrid Journal   (Followers: 1)
Communications in Contemporary Mathematics     Hybrid Journal  
Communications in Mathematical Physics     Hybrid Journal   (Followers: 1)
Communications On Pure & Applied Mathematics     Hybrid Journal   (Followers: 3)
Complex Analysis and its Synergies     Open Access   (Followers: 2)
Complex Variables and Elliptic Equations: An International Journal     Hybrid Journal  
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 9)
Comptes Rendus Mathematique     Full-text available via subscription   (Followers: 1)
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 Complexity     Hybrid Journal   (Followers: 4)
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 4)
Computational Methods and Function Theory     Hybrid Journal  
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computers & Mathematics with Applications     Full-text available via subscription   (Followers: 5)
Concrete Operators     Open Access   (Followers: 4)
Confluentes Mathematici     Hybrid Journal  
COSMOS     Hybrid Journal  
Cryptography and Communications     Hybrid Journal   (Followers: 14)
Cuadernos de Investigación y Formación en Educación Matemática     Open Access  
Cubo. A Mathematical Journal     Open Access  
Czechoslovak Mathematical Journal     Hybrid Journal   (Followers: 1)
Demographic Research     Open Access   (Followers: 11)
Demonstratio Mathematica     Open Access  
Dependence Modeling     Open Access  
Design Journal : An International Journal for All Aspects of Design     Hybrid Journal   (Followers: 29)
Developments in Clay Science     Full-text available via subscription   (Followers: 1)
Developments in Mineral Processing     Full-text available via subscription   (Followers: 3)
Dhaka University Journal of Science     Open Access  
Differential Equations and Dynamical Systems     Hybrid Journal   (Followers: 2)
Discrete Mathematics     Hybrid Journal   (Followers: 7)
Discrete Mathematics & Theoretical Computer Science     Open Access  
Discrete Mathematics, Algorithms and Applications     Hybrid Journal   (Followers: 2)
Discussiones Mathematicae Graph Theory     Open Access   (Followers: 1)
Dnipropetrovsk University Mathematics Bulletin     Open Access  
Doklady Mathematics     Hybrid Journal  
Duke Mathematical Journal     Full-text available via subscription   (Followers: 1)
Edited Series on Advances in Nonlinear Science and Complexity     Full-text available via subscription  
Electronic Journal of Graph Theory and Applications     Open Access   (Followers: 2)
Electronic Notes in Discrete Mathematics     Full-text available via subscription   (Followers: 2)
Elemente der Mathematik     Full-text available via subscription   (Followers: 3)
Energy for Sustainable Development     Hybrid Journal   (Followers: 9)
Enseñanza de las Ciencias : Revista de Investigación y Experiencias Didácticas     Open Access  
Ensino da Matemática em Debate     Open Access  
Entropy     Open Access   (Followers: 5)
ESAIM: Control Optimisation and Calculus of Variations     Full-text available via subscription   (Followers: 1)
European Journal of Combinatorics     Full-text available via subscription   (Followers: 4)
European Journal of Mathematics     Hybrid Journal   (Followers: 1)
European Scientific Journal     Open Access   (Followers: 2)
Experimental Mathematics     Hybrid Journal   (Followers: 4)
Expositiones Mathematicae     Hybrid Journal   (Followers: 2)
Facta Universitatis, Series : Mathematics and Informatics     Open Access  
Fasciculi Mathematici     Open Access  
Finite Fields and Their Applications     Full-text available via subscription   (Followers: 4)
Fixed Point Theory and Applications     Open Access   (Followers: 1)
Formalized Mathematics     Open Access   (Followers: 2)

        1 2 3 4 | 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  [2353 journals]
  • A quantitative Doignon-Bell-Scarf theorem
    • Authors: Iskander Aliev; Robert Bassett; Jesús A. De Loera; Quentin Louveaux
      Pages: 313 - 332
      Abstract: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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