for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> COMPUTER SCIENCE (Total: 2050 journals)
    - ANIMATION AND SIMULATION (30 journals)
    - ARTIFICIAL INTELLIGENCE (99 journals)
    - AUTOMATION AND ROBOTICS (100 journals)
    - CLOUD COMPUTING AND NETWORKS (64 journals)
    - COMPUTER ARCHITECTURE (9 journals)
    - COMPUTER ENGINEERING (10 journals)
    - COMPUTER GAMES (16 journals)
    - COMPUTER PROGRAMMING (27 journals)
    - COMPUTER SCIENCE (1196 journals)
    - COMPUTER SECURITY (46 journals)
    - DATA BASE MANAGEMENT (14 journals)
    - DATA MINING (32 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (28 journals)
    - ELECTRONIC DATA PROCESSING (22 journals)
    - IMAGE AND VIDEO PROCESSING (39 journals)
    - INFORMATION SYSTEMS (109 journals)
    - INTERNET (94 journals)
    - SOCIAL WEB (51 journals)
    - SOFTWARE (34 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1196 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: 20)
Abakós     Open Access   (Followers: 4)
ACM Computing Surveys     Hybrid Journal   (Followers: 22)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 8)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 11)
ACM Transactions on Accessible Computing (TACCESS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 15)
ACM Transactions on Applied Perception (TAP)     Hybrid Journal   (Followers: 5)
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: 12)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 3)
ACM Transactions on Computer Systems (TOCS)     Hybrid Journal   (Followers: 17)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 14)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 5)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 3)
ACM Transactions on Economics and Computation     Hybrid Journal  
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 19)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 7)
ACM Transactions on Interactive Intelligent Systems (TiiS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)     Hybrid Journal   (Followers: 9)
ACM Transactions on Reconfigurable Technology and Systems (TRETS)     Hybrid Journal   (Followers: 6)
ACM Transactions on Sensor Networks (TOSN)     Hybrid Journal   (Followers: 7)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 8)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 27)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 2)
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: 28)
Advanced Science Letters     Full-text available via subscription   (Followers: 9)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 7)
Advances in Artificial Intelligence     Open Access   (Followers: 15)
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: 18)
Advances in Computer Science : an International Journal     Open Access   (Followers: 15)
Advances in Computing     Open Access   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 51)
Advances in Engineering Software     Hybrid Journal   (Followers: 27)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 12)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 23)
Advances in Human-Computer Interaction     Open Access   (Followers: 19)
Advances in Materials Sciences     Open Access   (Followers: 14)
Advances in Operations Research     Open Access   (Followers: 12)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 6)
Advances in Porous Media     Full-text available via subscription   (Followers: 5)
Advances in Remote Sensing     Open Access   (Followers: 43)
Advances in Science and Research (ASR)     Open Access   (Followers: 4)
Advances in Technology Innovation     Open Access   (Followers: 5)
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)
AI EDAM     Hybrid Journal  
Air, Soil & Water Research     Open Access   (Followers: 11)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 5)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1)
Algorithms     Open Access   (Followers: 11)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 5)
American Journal of Computational Mathematics     Open Access   (Followers: 4)
American Journal of Information Systems     Open Access   (Followers: 5)
American Journal of Sensor Technology     Open Access   (Followers: 4)
Anais da Academia Brasileira de Ciências     Open Access   (Followers: 2)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 7)
Analysis in Theory and Applications     Hybrid Journal   (Followers: 1)
Animation Practice, Process & Production     Hybrid Journal   (Followers: 5)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 11)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 12)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of Software Engineering     Hybrid Journal   (Followers: 13)
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: 1)
Applied Artificial Intelligence: An International Journal     Hybrid Journal   (Followers: 13)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Clinical Informatics     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 11)
Applied Computer Systems     Open Access   (Followers: 2)
Applied Informatics     Open Access  
Applied Mathematics and Computation     Hybrid Journal   (Followers: 33)
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)
Applied System Innovation     Open Access  
Architectural Theory Review     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 5)
Archive of Numerical Software     Open Access  
Archives and Museum Informatics     Hybrid Journal   (Followers: 130)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5)
arq: Architectural Research Quarterly     Hybrid Journal   (Followers: 7)
Artifact     Hybrid Journal   (Followers: 2)
Artificial Life     Hybrid Journal   (Followers: 7)
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   (Followers: 1)
Automatic Control and Computer Sciences     Hybrid Journal   (Followers: 4)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Automatica     Hybrid Journal   (Followers: 11)
Automation in Construction     Hybrid Journal   (Followers: 6)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 9)
Basin Research     Hybrid Journal   (Followers: 5)
Behaviour & Information Technology     Hybrid Journal   (Followers: 52)
Big Data and Cognitive Computing     Open Access   (Followers: 2)
Biodiversity Information Science and Standards     Open Access  
Bioinformatics     Hybrid Journal   (Followers: 283)
Biomedical Engineering     Hybrid Journal   (Followers: 15)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 19)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 35)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 44)
British Journal of Educational Technology     Hybrid Journal   (Followers: 142)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 10)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 1)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal  
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 14)
Capturing Intelligence     Full-text available via subscription  
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal   (Followers: 2)
Cell Communication and Signaling     Open Access   (Followers: 2)
Central European Journal of Computer Science     Hybrid Journal   (Followers: 5)
CERN IdeaSquare Journal of Experimental Innovation     Open Access   (Followers: 2)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chemometrics and Intelligent Laboratory Systems     Hybrid Journal   (Followers: 14)
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: 11)
Circuits and Systems     Open Access   (Followers: 15)
Clean Air Journal     Full-text available via subscription   (Followers: 1)
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  
Combinatorics, Probability and Computing     Hybrid Journal   (Followers: 4)
Combustion Theory and Modelling     Hybrid Journal   (Followers: 14)
Communication Methods and Measures     Hybrid Journal   (Followers: 12)
Communication Theory     Hybrid Journal   (Followers: 20)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Algebra     Hybrid Journal   (Followers: 3)
Communications in Computational Physics     Full-text available via subscription   (Followers: 2)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 52)
Communications of the Association for Information Systems     Open Access   (Followers: 16)
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering     Hybrid Journal   (Followers: 3)
Complex & Intelligent Systems     Open Access   (Followers: 1)
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: 8)
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: 11)
Computational Chemistry     Open Access   (Followers: 2)
Computational Cognitive Science     Open Access   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Condensed Matter     Open Access  
Computational Ecology and Software     Open Access   (Followers: 9)
Computational Economics     Hybrid Journal   (Followers: 9)
Computational Geosciences     Hybrid Journal   (Followers: 15)
Computational Linguistics     Open Access   (Followers: 23)
Computational Management Science     Hybrid Journal  
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 5)
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: 14)
Computational Statistics & Data Analysis     Hybrid Journal   (Followers: 30)
Computer     Full-text available via subscription   (Followers: 94)
Computer Aided Surgery     Hybrid Journal   (Followers: 6)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 8)
Computer Communications     Hybrid Journal   (Followers: 10)
Computer Engineering and Applications Journal     Open Access   (Followers: 5)
Computer Journal     Hybrid Journal   (Followers: 9)
Computer Methods in Applied Mechanics and Engineering     Hybrid Journal   (Followers: 23)
Computer Methods in Biomechanics and Biomedical Engineering     Hybrid Journal   (Followers: 12)
Computer Methods in the Geosciences     Full-text available via subscription   (Followers: 2)
Computer Music Journal     Hybrid Journal   (Followers: 19)

        1 2 3 4 5 6 | Last

Journal Cover Annals of Combinatorics
  [SJR: 0.849]   [H-I: 15]   [3 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 0219-3094 - ISSN (Online) 0218-0006
   Published by Springer-Verlag Homepage  [2351 journals]
  • On the Number of Unary-Binary Tree-Like Structures with Restrictions on
           the Unary Height
    • Authors: Olivier Bodini; Danièle Gardy; Bernhard Gittenberger; Zbigniew Gołębiewski
      Pages: 45 - 91
      Abstract: We investigate various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: we either bound their number or the allowed levels of nesting. The enumeration is done by means of a generating function approach and singularity analysis. The generating functions are composed of nested square roots and exhibit unexpected phenomena in some of the cases. Furthermore, we present some observations obtained from generating such terms randomly and explain why usually powerful tools for random generation, such as Boltzmann samplers, face serious difficulties in generating lambda-terms.
      PubDate: 2018-03-01
      DOI: 10.1007/s00026-018-0371-7
      Issue No: Vol. 22, No. 1 (2018)
       
  • Quasisymmetric ( k , l )-Hook Schur Functions
    • Authors: Sarah K. Mason; Elizabeth Niese
      Pages: 167 - 199
      Abstract: We introduce a quasisymmetric generalization of Berele and Regev’s hook Schur functions and prove that these new quasisymmetric hook Schur functions decompose the hook Schur functions in a natural way. We examine the combinatorics of the quasisymmetric hook Schur functions, providing a relationship to Gessel’s fundamental quasisymmetric functions and an analogue of the Robinson-Schensted-Knuth algorithm. We also prove that the multiplication of quasisymmetric hook Schur functions with hook Schur functions behaves the same as the multiplication of quasisymmetric Schur functions with Schur functions.
      PubDate: 2018-03-01
      DOI: 10.1007/s00026-018-0376-2
      Issue No: Vol. 22, No. 1 (2018)
       
  • A Classification of Orientably Edge-Transitive Circular Embeddings of
           $${{\rm K}_{{p^e}, p^{f}}}$$ K p e , p f
    • Authors: Wenwen Fan; Cai Heng Li; Hai Peng Qu
      Abstract: We show that a complete bipartite graph \({{\bf K}_{{p^e}, p_{f}}}\) , where p is an odd prime, has an edge-transitive embedding in an orientable surface with all faces bounded by simple cycles if and only if e = f. There are exactly \({p^{2(e-1)}}\) such embeddings up to isomorphism. Among them, \({p^{e-1}}\) are orientably regular, one of which is reflexible and \({p^{e-1} -1}\) form chiral pairs. The remaining \({p^{2(e-1)} - p^{e-1}}\) embeddings are non-regular (not arc-transitive). All of these embeddings have genus \({\frac{1}{2} (p^{e}-1) (p^{e}-2)}\) .
      PubDate: 2018-02-05
      DOI: 10.1007/s00026-018-0373-5
       
  • Remark on a Result of Constantine
    • Authors: Padraig Ó Catháin
      Abstract: In this short note we construct codes of length 4n with 8n+8 codewords and minimum distance 2n−2 whenever 4n+4 is the order of a Hadamard matrix. This generalises work of Constantine who obtained a similar result in the special case that n is a prime power.
      PubDate: 2018-02-05
      DOI: 10.1007/s00026-018-0379-z
       
  • Constructing Dominating Sets in Circulant Graphs
    • Authors: Igor E. Shparlinski
      Abstract: We give efficient constructions of reasonably small dominating sets of various types in a circulant graph on n notes and k distinct chord lengths. The structure of a cyclic group underlying circulant graph makes them suitable for applications of methods of analytic number theory. In particular, our results are based on bounds on some double exponential sums.
      PubDate: 2018-02-05
      DOI: 10.1007/s00026-018-0377-1
       
  • Universal Geometric Coefficients for the Four-Punctured Sphere
    • Authors: Emily Barnard; Emily Meehan; Nathan Reading; Shira Viel
      Abstract: We construct universal geometric coefficients for the cluster algebra associated to the four-punctured sphere and obtain, as a by-product, the g-vectors of cluster variables. We also construct the rational part of the mutation fan. These constructions rely on a classification of the allowable curves (the curves which can appear in quasi-laminations). The classification allows us to prove the Null Tangle Property for the four-punctured sphere, thus adding this surface to a short list of surfaces for which this property is known. The Null Tangle Property then implies that the shear coordinates of allowable curves are the universal coefficients. We compute shear coordinates explicitly to obtain universal geometric coefficients.
      PubDate: 2018-02-05
      DOI: 10.1007/s00026-018-0378-0
       
  • A Combinatorial Proof of a Symmetry of ( t , q )-Eulerian Numbers of Type
           B and Type D
    • Authors: Soojin Cho; Kyoungsuk Park
      Abstract: A symmetry of (t, q)-Eulerian numbers of type B is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type B, which solves the problem suggested by Corteel in [12]. This involution also proves a symmetry of the generating polynomial \({\hat{D}_{n,k} (p, q, r)}\) of the numbers of crossings and alignments, and hence q-Eulerian numbers of type A defined by Lauren K.Williams. By considering a restriction of our bijection, we were led to define a new statistic on the permutations of type D and (t, q)-Eulerian numbers of type D, which is proved to have a particular symmetry as well. We conjecture that our new statistic is in the family of Eulerian statistics for the permutations of type D.
      PubDate: 2018-02-05
      DOI: 10.1007/s00026-018-0372-6
       
  • Lattice Paths, Young Tableaux, and Weight Multiplicities
    • Authors: Rebecca L. Jayne; Kailash C. Misra
      Abstract: For \({\ell \geq 1}\) and \({k \geq 2}\) , we consider certain admissible sequences of k−1 lattice paths in a colored \({\ell \times \ell}\) square. We show that the number of such admissible sequences of lattice paths is given by the sum of squares of the number of standard Young tableaux of shape \({\lambda \vdash \ell}\) with \({l(\lambda) \leq k}\) , which is also the number of (k + 1)k··· 21-avoiding permutations in \({S_\ell}\) . Finally, we apply this result to the representation theory of the affine Lie algebra \({\widehat{sl}(n)}\) and show that this gives the multiplicity of certain maximal dominant weights in the irreducible highest weight \({\widehat{sl}(n)}\) -module \({V(k \Lambda_0)}\) .
      PubDate: 2018-02-02
      DOI: 10.1007/s00026-018-0374-4
       
  • Intersections of Maximal Subspaces of Zeros of Two Quadratic Forms
    • Authors: David B. Leep; Claus Schubert
      Abstract: We calculate the dimensions of the intersections of maximal subspaces of zeros of a nonsingular pair of quadratic forms. We then count the number of sets of distinct such subspaces that intersect in a given dimension.
      PubDate: 2018-02-01
      DOI: 10.1007/s00026-018-0375-3
       
  • Syzygies on Tutte Polynomials of Freedom Matroids
    • Authors: Joseph P.S. Kung
      Abstract: It follows from a theorem of Derksen [J. Algebraic Combin., 30 (2009) 43–86] that the Tutte polynomial of a rank-r matroid on an n-set is “naturally” a linear combination of Tutte polynomials of rank-r size-n freedom matroids. However, the Tutte polynomials of rank-r size-n freedom matroids are not linearly independent. We construct two natural bases for these polynomials and as a corollary, we prove that the Tutte polynomials of rank-r matroids of size-n span a subspace of dimension \({r(n-r)+1}\) . We also find a generating set for the linear relations between Tutte polynomials of freedom matroids. This generating set is indexed by a pair of intervals, one of size 2 and one of size 4, in the weak order of freedom matroids. This weak order is a distributive lattice and a sublattice of Young’s partition lattice.
      PubDate: 2017-10-07
      DOI: 10.1007/s00026-017-0370-0
       
  • Arithmetic Properties of m -ary Partitions Without Gaps
    • Abstract: Motivated by recent work of Bessenrodt, Olsson, and Sellers on unique path partitions, we consider partitions of an integer n wherein the parts are all powers of a fixed integer \({m \geq 2}\) and there are no "gaps" in the parts; that is, if \({m^i}\) is the largest part in a given partition, then \({m^j}\) also appears as a part in the partition for each \({0 \leq j < i}\) . Our ultimate goal is to prove an infinite family of congruences modulo powers of m which are satisfied by these functions.
      PubDate: 2017-09-08
      DOI: 10.1007/s00026-017-0369-6
       
  • Shifted Distinct-part Partition Identities in Arithmetic Progressions
    • Authors: Ethan Alwaise; Robert Dicks; Jason Friedman; Lianyan Gu; Zach Harner; Hannah Larson; Madeline Locus; Ian Wagner; Josh Weinstock
      Abstract: The partition function p(n), which counts the number of partitions of a positive integer n, is widely studied. Here, we study partition functions pS(n) that count partitions of n into distinct parts satisfying certain congruence conditions. A shifted partition identity is an identity of the form \({{p_{S_1}} (n - H) = {p_{S_2}} (n)}\) for all n in some arithmetic progression. Several identities of this type have been discovered, including two infinite families found by Alladi. In this paper, we use the theory of modular functions to determine the necessary and sufficient conditions for such an identity to exist. In addition, for two specific cases, we extend Alladi’s theorem to other arithmetic progressions.
      PubDate: 2017-08-28
      DOI: 10.1007/s00026-017-0360-2
       
  • Vincular Pattern Posets and the Möbius Function of the
           Quasi-Consecutive Pattern Poset
    • Authors: Antonio Bernini; Luca Ferrari
      Abstract: We introduce vincular pattern posets, then we consider in particular the quasiconsecutive pattern poset, which is defined by declaring σ ≤ τ whenever the permutation τ contains an occurrence of the permutation σ in which all the entries are adjacent in τ except at most the first and the second. We investigate the Möbius function of the quasi-consecutive pattern poset and we completely determine it for those intervals [σ, τ] such that σ occurs precisely once in τ.
      PubDate: 2017-08-21
      DOI: 10.1007/s00026-017-0364-y
       
  • Multigraph Hyperplane Arrangements and Parking Functions
    • Authors: Mikhail Mazin
      Abstract: Pak and Stanley introduced a labeling of the regions of a k-Shi arrangement by k-parking functions and proved its bijectivity. Duval, Klivans, and Martin considered a modification of this construction associated with a graph G. They introduced the G-Shi arrangement and a labeling of its regions by G-parking functions. They conjectured that their labeling is surjective, i.e., that every G-parking function appears as a label of a region of the G-Shi arrangement. Later Hopkins and Perkinson proved this conjecture. In particular, this provided a new proof of the bijectivity of Pak-Stanley labeling in the k = 1 case. We generalize Hopkins-Perkinson’s construction to the case of arrangements associated with oriented multigraphs. In particular, our construction provides a simple straightforward proof of the bijectivity of the original Pak-Stanley labeling for arbitrary k.
      PubDate: 2017-08-21
      DOI: 10.1007/s00026-017-0368-7
       
  • On $${\pi}$$ π -Surfaces of Four-Dimensional Parallelohedra
    • Authors: Alexey Garber
      Abstract: We show that every four-dimensional parallelohedron P satisfies a recently found condition of Garber, Gavrilyuk & Magazinov sufficient for the Voronoi conjecture being true for P. Namely, we show that for every four-dimensional parallelohedron P the one-dimensional homology group of its \({\pi}\) -surface is generated by half-belt cycles.
      PubDate: 2017-08-21
      DOI: 10.1007/s00026-017-0366-9
       
  • Inequalities Between Odd Moments of Rank and Crank for Overpartitions
    • Authors: Renrong Mao
      Abstract: In this paper, we introduce the symmetrized positive rank and crank moments of overpartitions and obtain some inequalities between them. These results enable us to settle a conjecture of Andrews, Chan, Kim, and Osburn on inequalities between ordinary rank and crank moments of overpartitions.
      PubDate: 2017-08-21
      DOI: 10.1007/s00026-017-0367-8
       
  • Longest Increasing Subsequences and Log Concavity
    • Authors: Miklós Bóna; Marie-Louise Lackner; Bruce E. Sagan
      Abstract: Let \({\pi}\) be a permutation of [n] = {1, . . . , n} and denote by \({\ell(\pi)}\) the length of a longest increasing subsequence of \({\pi}\) . Let \({\ell_n,k}\) be the number of permutations \({\pi}\) of [n] with \({\ell(\pi) = k}\) . Chen conjectured that the sequence \({\ell_{n,1}, \ell_{n,2}, . . . , \ell_{n,n}}\) is log concave for every fixed positive integer n. We conjecture that the same is true if one is restricted to considering involutions and we show that these two conjectures are closely related. We also prove various analogues of these conjectures concerning permutations whose output tableaux under the Robinson-Schensted algorithm have certain shapes. In addition, we present a proof of Deift that part of the limiting distribution is log concave. Various other conjectures are discussed.
      PubDate: 2017-08-19
      DOI: 10.1007/s00026-017-0365-x
       
  • The Generalized Translation Dual of a Semifield
    • Authors: G. Lunardon; G. Marino; O. Polverino; R. Trombetti
      Abstract: In this paper, elaborating on the link between semifields of dimension n over their left nucleus and \({\mathbb{F}s}\) -linear sets of rank en disjoint from the secant variety \({\Omega(\mathcal{S}_{n,n})}\) of the Segre variety \({\mathcal{S}_{n,n}}\) of \({PG(n^2-1, q), q=s^e}\) , we extend some operations on semifield whose definition relies on dualising the relevant linear set.
      PubDate: 2017-08-07
      DOI: 10.1007/s00026-017-0362-0
       
  • On the Complexity of Computing MP Distance Between Binary Phylogenetic
           Trees
    • Authors: Steven Kelk; Mareike Fischer
      Abstract: Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Recently, a new distance measure has been proposed: the Maximum Parsimony (MP) distance. This is based on the difference of the parsimony scores of a single character on both trees under consideration, and the goal is to find the character which maximizes this difference. Here we show that computation of MP distance on two binary phylogenetic trees is NP-hard. This is a highly nontrivial extension of an earlier NP-hardness proof for two multifurcating phylogenetic trees, and it is particularly relevant given the prominence of binary trees in the phylogenetics literature. As a corollary to the main hardness result we show that computation of MP distance is also hard on binary trees if the number of states available is bounded. In fact, via a different reduction we show that it is hard even if only two states are available. Finally, as a first response to this hardness we give a simple Integer Linear Program (ILP) formulation which is capable of computing the MP distance exactly for small trees (and for larger trees when only a small number of character states are available) and which is used to computationally verify several auxiliary results required by the hardness proofs.
      PubDate: 2017-08-07
      DOI: 10.1007/s00026-017-0361-1
       
  • On the Number of Parts of Integer Partitions Lying in Given Residue
           Classes
    • Authors: Olivia Beckwith; Michael H. Mertens
      Abstract: Improving upon previous work [3] on the subject, we use Wright’s Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer n that are in any given arithmetic progression.
      PubDate: 2017-08-05
      DOI: 10.1007/s00026-017-0363-z
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.198.164.83
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-