for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> COMPUTER SCIENCE (Total: 2102 journals)
    - ANIMATION AND SIMULATION (31 journals)
    - ARTIFICIAL INTELLIGENCE (103 journals)
    - AUTOMATION AND ROBOTICS (105 journals)
    - CLOUD COMPUTING AND NETWORKS (64 journals)
    - COMPUTER ARCHITECTURE (10 journals)
    - COMPUTER ENGINEERING (11 journals)
    - COMPUTER GAMES (21 journals)
    - COMPUTER PROGRAMMING (26 journals)
    - COMPUTER SCIENCE (1221 journals)
    - COMPUTER SECURITY (47 journals)
    - DATA BASE MANAGEMENT (14 journals)
    - DATA MINING (36 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (30 journals)
    - ELECTRONIC DATA PROCESSING (22 journals)
    - IMAGE AND VIDEO PROCESSING (40 journals)
    - INFORMATION SYSTEMS (108 journals)
    - INTERNET (95 journals)
    - SOCIAL WEB (53 journals)
    - SOFTWARE (34 journals)
    - THEORY OF COMPUTING (9 journals)

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

Showing 1 - 200 of 872 Journals sorted alphabetically
3D Printing and Additive Manufacturing     Full-text available via subscription   (Followers: 21)
Abakós     Open Access   (Followers: 4)
ACM Computing Surveys     Hybrid Journal   (Followers: 29)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 8)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 16)
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: 9)
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: 18)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 15)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 6)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 6)
ACM Transactions on Economics and Computation     Hybrid Journal   (Followers: 1)
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 20)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 8)
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: 8)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 9)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Hybrid Journal   (Followers: 32)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 2)
Acta Informatica Malaysia     Open Access  
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Ad Hoc Networks     Hybrid Journal   (Followers: 11)
Adaptive Behavior     Hybrid Journal   (Followers: 10)
Advanced Engineering Materials     Hybrid Journal   (Followers: 28)
Advanced Science Letters     Full-text available via subscription   (Followers: 11)
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: 4)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 19)
Advances in Computer Engineering     Open Access   (Followers: 4)
Advances in Computer Science : an International Journal     Open Access   (Followers: 14)
Advances in Computing     Open Access   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 55)
Advances in Engineering Software     Hybrid Journal   (Followers: 28)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 14)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 22)
Advances in Human-Computer Interaction     Open Access   (Followers: 20)
Advances in Materials Science     Open Access   (Followers: 14)
Advances in Operations Research     Open Access   (Followers: 12)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 7)
Advances in Porous Media     Full-text available via subscription   (Followers: 5)
Advances in Remote Sensing     Open Access   (Followers: 49)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Advances in Technology Innovation     Open Access   (Followers: 6)
AEU - International Journal of Electronics and Communications     Hybrid Journal   (Followers: 8)
African Journal of Information and Communication     Open Access   (Followers: 9)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
AI EDAM     Hybrid Journal   (Followers: 1)
Air, Soil & Water Research     Open Access   (Followers: 12)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 6)
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: 6)
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: 4)
Annals of Data Science     Hybrid Journal   (Followers: 12)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 13)
Annals of Pure and Applied Logic     Open Access   (Followers: 3)
Annals of Software Engineering     Hybrid Journal   (Followers: 13)
Annals of West University of Timisoara - Mathematics and Computer Science     Open Access  
Annual Reviews in Control     Hybrid Journal   (Followers: 8)
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: 12)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 13)
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: 5)
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: 145)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5)
arq: Architectural Research Quarterly     Hybrid Journal   (Followers: 8)
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: 5)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Automatica     Hybrid Journal   (Followers: 13)
Automation in Construction     Hybrid Journal   (Followers: 7)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 8)
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: 308)
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: 20)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 35)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 49)
British Journal of Educational Technology     Hybrid Journal   (Followers: 149)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 12)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 1)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal   (Followers: 2)
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 15)
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: 3)
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: 8)
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
CIN Computers Informatics Nursing     Hybrid Journal   (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)
Clinical eHealth     Open Access  
Cluster Computing     Hybrid Journal   (Followers: 2)
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: 23)
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 Information Science and Management Engineering     Open Access   (Followers: 4)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 51)
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   (Followers: 1)
Computational and Applied Mathematics     Hybrid Journal   (Followers: 3)
Computational and Mathematical Biophysics     Open Access   (Followers: 1)
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: 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: 17)
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: 8)
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: 99)
Computer Aided Surgery     Open Access   (Followers: 6)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 8)
Computer Communications     Hybrid Journal   (Followers: 16)
Computer Journal     Hybrid Journal   (Followers: 9)

        1 2 3 4 5 6 7 | Last

Journal Cover
Annals of Combinatorics
Journal Prestige (SJR): 0.932
Citation Impact (citeScore): 1
Number of Followers: 4  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 0219-3094 - ISSN (Online) 0218-0006
Published by Springer-Verlag Homepage  [2349 journals]
  • Weyl Group $${\varvec{q}}$$ q -Kreweras Numbers and Cyclic Sieving
    • Authors: Victor Reiner; Eric Sommers
      Abstract: Catalan numbers are known to count noncrossing set partitions, while Narayana and Kreweras numbers refine this count according to the number of blocks in the set partition, and by its collection of block sizes. Motivated by reflection group generalizations of Catalan numbers and their q-analogues, this paper concerns a definition of q-Kreweras numbers for finite Weyl groups W, refining the q-Catalan numbers for W, and arising from work of the second author. We give explicit formulas in all types for the q-Kreweras numbers. In the classical types A, B, C, we also record formulas for the q-Narayana numbers and in the process show that the formulas depend only on the Weyl group (that is, they coincide in types B and C). In addition, we verify that in the classical types A, B, C, D the q-Kreweras numbers obey the expected cyclic sieving phenomena when evaluated at appropriate roots of unity.
      PubDate: 2018-11-13
      DOI: 10.1007/s00026-018-0408-y
       
  • Realization of Groups with Pairing as Jacobians of Finite Graphs
    • Authors: Louis Gaudet; David Jensen; Dhruv Ranganathan; Nicholas Wawrykow; Theodore Weisman
      Abstract: We study which groups with pairing can occur as the Jacobian of a finite graph. We provide explicit constructions of graphs whose Jacobian realizes a large fraction of odd groups with a given pairing. Conditional on the generalized Riemann hypothesis, these constructions yield all groups with pairing of odd order, and unconditionally, they yield all groups with pairing whose prime factors are sufficiently large. For groups with pairing of even order, we provide a partial answer to this question, for a certain restricted class of pairings. Finally, we explore which finite abelian groups occur as the Jacobian of a simple graph. There exist infinite families of finite abelian groups that do not occur as the Jacobians of simple graphs.
      PubDate: 2018-11-02
      DOI: 10.1007/s00026-018-0406-0
       
  • A Generalized SXP Rule Proved by Bijections and Involutions
    • Authors: Mark Wildon
      Abstract: This paper proves a combinatorial rule expressing the product \(s_\tau (s_{\lambda /\mu } \circ p_r)\) of a Schur function and the plethysm of a skew Schur function with a power-sum symmetric function as an integral linear combination of Schur functions. This generalizes the SXP rule for the plethysm \(s_\lambda \circ p_r\) . Each step in the proof uses either an explicit bijection or a sign-reversing involution. The proof is inspired by an earlier proof of the SXP rule due to Remmel and Shimozono (Discrete Math. 193:257–266, 1998). The connections with two later combinatorial rules for special cases of this plethysm are discussed. Two open problems are raised. The paper is intended to be readable by non-experts.
      PubDate: 2018-11-01
      DOI: 10.1007/s00026-018-0409-x
       
  • On the Crank Function of Cubic Partition Pairs
    • Authors: Byungchan Kim; Pee Choon Toh
      Abstract: We study a crank function M(m, n) for cubic partition pairs. We show that the function M(m, n) explains a cubic partition pair congruence and we also obtain various arithmetic properties regarding M(m, n). In particular, using the \(\Theta \) -operator, we confirm a conjecture on the sign pattern of c(n), the number of cubic partition pairs of n, weighted by the parity of the crank.
      PubDate: 2018-10-13
      DOI: 10.1007/s00026-018-0407-z
       
  • Prisms and Pyramids of Shelling Components
    • Authors: Richard Ehrenborg
      Abstract: We study how the shelling components behave under the pyramid and prism operations. As a consequence we obtain a concise recursion for the cubical shelling contributions.
      PubDate: 2018-10-11
      DOI: 10.1007/s00026-018-0412-2
       
  • Combinatorial Aspects of the Quantized Universal Enveloping Algebra of
           $$\mathfrak {sl}_{n+1}$$ sl n + 1
    • Authors: Raymond Cheng; David M. Jackson; Geoff J. Stanley
      Abstract: Quasi-triangular Hopf algebras were introduced by Drinfel’d in his construction of solutions to the Yang–Baxter Equation. This algebra is built upon \(\mathscr {U}_h(\mathfrak {sl}_2)\) , the quantized universal enveloping algebra of the Lie algebra \(\mathfrak {sl}_2\) . In this paper, combinatorial structure in \(\mathscr {U}_h(\mathfrak {sl}_2)\) is elicited, and used to assist in highly intricate calculations in this algebra. To this end, a combinatorial methodology is formulated for straightening algebraic expressions to a canonical form in the case \(n=1\) . We apply this formalism to the quasi-triangular Hopf algebras and obtain a constructive account not only for the derivation of the Drinfel’d’s \(sR\) -matrix, but also for the arguably mysterious ribbon elements of \(\mathscr {U}_h(\mathfrak {sl}_2)\) . Finally, we extend these techniques to the higher-dimensional algebras \(\mathscr {U}_h(\mathfrak {sl}_{n+1})\) . While these explicit algebraic results are well known, our contribution is in our formalism and perspective: our emphasis is on the combinatorial structure of these algebras and how that structure may guide algebraic constructions.
      PubDate: 2018-10-10
      DOI: 10.1007/s00026-018-0404-2
       
  • Permutations Resilient to Deletions
    • Authors: Noga Alon; Steve Butler; Ron Graham; Utkrisht C. Rajkumar
      Abstract: Let \(M = (s_1, s_2, \ldots , s_n) \) be a sequence of distinct symbols and \(\sigma \) a permutation of \(\{1,2, \ldots , n\}\) . Denote by \(\sigma (M)\) the permuted sequence \((s_{\sigma (1)}, s_{\sigma (2)}, \ldots , s_{\sigma (n)})\) . For a given positive integer d, we will say that \(\sigma \) is d-resilient if no matter how d entries of M are removed from M to form \(M'\) and d entries of \(\sigma (M)\) are removed from \(\sigma (M)\) to form \(\sigma (M)'\) (with no symbol being removed from both sequences), it is always possible to reconstruct the original sequence M from \(M'\) and \(\sigma (M)'\) . Necessary and sufficient conditions for a permutation to be d-resilient are established in terms of whether certain auxiliary graphs are acyclic. We show that for d-resilient permutations for [n] to exist, n must have size at least exponential in d, and we give an algorithm to construct such permutations in this case. We show that for each d and all sufficiently large n, the fraction of all permutations on n elements which are d-resilient is bounded away from 0.
      PubDate: 2018-10-05
      DOI: 10.1007/s00026-018-0403-3
       
  • Volume, Facets and Dual Polytopes of Twinned Chain Polytopes
    • Authors: Akiyoshi Tsuchiya
      Abstract: Let \((P,\le _P)\) and \((Q,\le _Q)\) be finite partially ordered sets with \( P = Q =d\) , and \(\mathcal {C}(P) \subset \mathbb {R}^d\) and \(\mathcal {C}(Q) \subset \mathbb {R}^d\) their chain polytopes. The twinned chain polytope of P and Q is the lattice polytope \(\Gamma (\mathcal {C}(P),\mathcal {C}(Q)) \subset \mathbb {R}^d\) which is the convex hull of \(\mathcal {C}(P) \cup (-\mathcal {C}(Q))\) . It is known that twinned chain polytopes are Gorenstein Fano polytopes with the integer decomposition property. In the present paper, we study combinatorial properties of twinned chain polytopes. First, we will give the formula of the volume of twinned chain polytopes in terms of the underlying partially ordered sets. Second, we will identify the facet-supporting hyperplanes of twinned chain polytopes in terms of the underlying partially ordered sets. Finally, we will provide the vertex representations of the dual polytopes of twinned chain polytopes.
      PubDate: 2018-10-05
      DOI: 10.1007/s00026-018-0405-1
       
  • The Distribution of the Carlitz Binomial Coefficients Modulo a Prime
    • Authors: Dong Quan Ngoc Nguyen
      Abstract: For a nonnegative integer n, and a prime \({\mathcal{P}}\) in \({\mathbb{F}_{q}[T]}\) , we prove a result that provides a method for computing the number of integers m with \({0 \leq m \leq n}\) for which the Carlitz binomial coefficients \({(_{m}^{n})_{C}}\) fall into each of the residue classes modulo \({\mathcal{P}}\) . Our main result can be viewed as a function field analogue of the Garfield-Wilf theorem.
      PubDate: 2018-07-27
      DOI: 10.1007/s00026-018-0400-6
       
  • Counting SET-Free Sets
    • Authors: Nate Harman
      Abstract: We consider the following counting problem related to the card game SET: how many k-element SET-free sets are there in an n-dimensional SET deck' Through a series of algebraic reformulations and reinterpretations, we show the answer to this question satisfies two polynomiality conditions.
      PubDate: 2018-07-27
      DOI: 10.1007/s00026-018-0401-5
       
  • On the Density of the Odd Values of the Partition Function
    • Authors: Samuel D. Judge; William J. Keith; Fabrizio Zanello
      Abstract: The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely, the conjecture that the partition function p(n) is equidistributed modulo 2. Our main result will relate the densities, say, \({\delta_t}\) , of the odd values of the t-multipartition functions \({p_t(n)}\) , for several integers t. In particular, we will show that if \({\delta_t > 0}\) for some \({t \in \{5, 7, 11, 13, 17, 19, 23, 25\}}\) , then (assuming it exists) \({\delta_1 > 0}\) ; that is, p(n) itself is odd with positive density. Notice that, currently, the best unconditional result does not even imply that p(n) is odd for \({\sqrt{x}}\) values of \({n \leq x}\) . In general, we conjecture that \({\delta_t = 1/2}\) for all t odd, i.e., that similarly to the case of p(n), all multipartition functions are in fact equidistributed modulo 2. Our arguments will employ a number of algebraic and analytic methods, ranging from an investigation modulo 2 of some classical Ramanujan identities and several other eta product results, to a unified approach that studies the parity of the Fourier coefficients of a broad class of modular form identities recently introduced by Radu.
      PubDate: 2018-07-24
      DOI: 10.1007/s00026-018-0397-x
       
  • Integer Partitions with Even Parts Below Odd Parts and the Mock Theta
           Functions
    • Authors: George E. Andrews
      Abstract: The paper begins with a study of a couple of classes of partitions in which each even part is smaller than each odd. In one class, a Dyson-type crank exists to explain a mod 5 congruence. The second part of the paper treats the arithmetic and combinatorial properties of the third order mock theta function \({\nu(q)}\) and relates the even part of \({\nu(q)}\) to the partitions initially considered. We also consider a surprisingly simple combinatorial relationship between the cranks and the ranks of the partition of n.
      PubDate: 2018-07-16
      DOI: 10.1007/s00026-018-0398-9
       
  • On Perturbations of Highly Connected Dyadic Matroids
    • Authors: Kevin Grace; Stefan H. M. van Zwam
      Abstract: Geelen, Gerards, and Whittle [3] announced the following result: let \({q = p^k}\) be a prime power, and let \({\mathcal{M}}\) be a proper minor-closed class of GF(q)-representable matroids, which does not contain PG(r − 1, p) for sufficiently high r. There exist integers k, t such that every vertically k-connected matroid in \({\mathcal{M}}\) is a rank- \({(\leq t)}\) perturbation of a frame matroid or the dual of a frame matroid over GF(q). They further announced a characterization of the perturbations through the introduction of subfield templates and frame templates. We show a family of dyadic matroids that form a counterexample to this result. We offer several weaker conjectures to replace the ones in [3], discuss consequences for some published papers, and discuss the impact of these new conjectures on the structure of frame templates.
      PubDate: 2018-07-16
      DOI: 10.1007/s00026-018-0396-y
       
  • Toric Degenerations of Gr(2, n ) and Gr(3, 6) via Plabic Graphs
    • Authors: L. Bossinger; X. Fang; G. Fourier; M. Hering; M. Lanini
      Abstract: We establish an explicit bijection between the toric degenerations of the Grassmannian Gr(2, n) arising from maximal cones in tropical Grassmannians and the ones coming from plabic graphs corresponding to Gr(2, n). We show that a similar statement does not hold for Gr(3, 6).
      PubDate: 2018-07-16
      DOI: 10.1007/s00026-018-0395-z
       
  • Jacobi-Trudi Determinants over Finite Fields
    • Authors: Ben Anzis; Shuli Chen; Yibo Gao; Jesse Kim; Zhaoqi Li; Rebecca Patrias
      Abstract: In this paper, we work toward answering the following question: given a uniformly random algebra homomorphism from the ring of symmetric functions over \({\mathbb{Z}}\) to a finite field \({\mathbb{F}_{q}}\) , what is the probability that the Schur function \({s_{\lambda}}\) maps to zero' We show that this probability is always at least 1/q and is asymptotically 1/q. Moreover, we give a complete classification of all shapes that can achieve probability 1/q. In addition, we identify certain families of shapes for which the events that the corresponding Schur functions are sent to zero are independent. We also look into the probability that Schur functions are mapped to nonzero values in \({\mathbb{F}_{q}}\) .
      PubDate: 2018-07-16
      DOI: 10.1007/s00026-018-0399-8
       
  • From Partition Identities to a Combinatorial Approach to Explicit Satake
           Inversion
    • Abstract: In this paper, we provide combinatorial proofs for certain partition identities which arise naturally in the context of Langlands’ beyond endoscopy proposal. These partition identities motivate an explicit plethysm expansion of \({{\rm Sym}^j}\) \({{{\rm Sym}^{k}}V}\) for \({{\rm GL}_2}\) in the case k = 3. We compute the plethysm explicitly for the cases k = 3, 4. Moreover, we use these expansions to explicitly compute the basic function attached to the symmetric power L-function of \({{\rm GL}_2}\) for these two cases.
      PubDate: 2018-06-06
      DOI: 10.1007/s00026-018-0391-3
       
  • Permutation Totally Symmetric Self-Complementary Plane Partitions
    • Abstract: Alternating sign matrices and totally symmetric self-complementary plane partitions are equinumerous sets of objects for which no explicit bijection is known. In this paper, we identify a subset of totally symmetric self-complementary plane partitions corresponding to permutations by giving a statistic-preserving bijection to permutation matrices, which are a subset of alternating sign matrices. We use this bijection to define a new partial order on permutations, and prove this new poset contains both the Tamari lattice and the Catalan distributive lattice as subposets. We also study a new partial order on totally symmetric self-complementary plane partitions arising from this perspective and show that this is a distributive lattice related to Bruhat order when restricted to permutations.
      PubDate: 2018-06-06
      DOI: 10.1007/s00026-018-0394-0
       
  • Ehrhart Series of Fractional Stable Set Polytopes of Finite Graphs
    • Authors: Ginji Hamano; Takayuki Hibi; Hidefumi Ohsugi
      Abstract: The fractional stable set polytope FRAC(G) of a simple graph G with d vertices is a rational polytope that is the set of nonnegative vectors (x1, . . . , x d ) satisfying x i +  xj \({\leq}\) 1 for every edge (i, j) of G. In this paper we show that (i) the \({\delta}\) -vector of a lattice polytope 2FRAC(G) is alternatingly increasing, (ii) the Ehrhart ring of FRAC(G) is Gorenstein, (iii) the coefficients of the numerator of the Ehrhart series of FRAC(G) are symmetric, unimodal and computed by the \({\delta}\) -vector of 2FRAC(G).
      PubDate: 2018-06-05
      DOI: 10.1007/s00026-018-0392-2
       
  • Once Punctured Disks, Non-Convex Polygons, and Pointihedra
    • Authors: Hugo Parlier; Lionel Pournin
      Abstract: We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once punctured polygons which, in turn, contain all possible geometric flip-graphs of polygons with a marked point as embedded sub-graphs. Our main focus is on the geometric properties of these graphs and how they relate to one another. In particular, we show that the embeddings between them are strongly convex (or, said otherwise, totally geodesic). We find bounds on the diameters of these graphs, sometimes using the strongly convex embeddings and show that the topological flip-graph is Hamiltonian. These graphs relate to different polytopes, namely to type D associahedra and a family of secondary polytopes which we call pointihedra.
      PubDate: 2018-06-05
      DOI: 10.1007/s00026-018-0393-1
       
  • AWilbrink-Like Equation for Neo-Difference Sets
    • Authors: Patrick G. Cesarz; Robert S. Coulter
      Abstract: Neo-difference sets arise in the study of projective planes of Lenz-Barlotti types I.3 and I.4. In the course of their proof that an abelian neo-difference set of order 3n satisfies either n = 1 or 3 n, Ghinelli and Jungnickel produce a Wilbrink-like equation for neo-difference sets of order 3n. In this note we generalise that part of their proof to produce a version of this equation that holds for all neo-difference sets.
      PubDate: 2018-04-23
      DOI: 10.1007/s00026-018-0382-4
       
 
 
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.167.18.170
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-