for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> COMPUTER SCIENCE (Total: 1993 journals)     - ANIMATION AND SIMULATION (29 journals)    - ARTIFICIAL INTELLIGENCE (99 journals)    - AUTOMATION AND ROBOTICS (100 journals)    - CLOUD COMPUTING AND NETWORKS (63 journals)    - COMPUTER ARCHITECTURE (9 journals)    - COMPUTER ENGINEERING (9 journals)    - COMPUTER GAMES (16 journals)    - COMPUTER PROGRAMMING (24 journals)    - COMPUTER SCIENCE (1157 journals)    - COMPUTER SECURITY (46 journals)    - DATA BASE MANAGEMENT (13 journals)    - DATA MINING (32 journals)    - E-BUSINESS (22 journals)    - E-LEARNING (27 journals)    - ELECTRONIC DATA PROCESSING (21 journals)    - IMAGE AND VIDEO PROCESSING (40 journals)    - INFORMATION SYSTEMS (104 journals)    - INTERNET (91 journals)    - SOCIAL WEB (50 journals)    - SOFTWARE (33 journals)    - THEORY OF COMPUTING (8 journals) COMPUTER SCIENCE (1157 journals)                  1 2 3 4 5 6 | Last
 Showing 1 - 200 of 872 Journals sorted alphabetically 3D Printing and Additive Manufacturing       (Followers: 13) Abakós       (Followers: 3) Academy of Information and Management Sciences Journal       (Followers: 69) ACM Computing Surveys       (Followers: 22) ACM Journal on Computing and Cultural Heritage       (Followers: 9) ACM Journal on Emerging Technologies in Computing Systems       (Followers: 13) ACM Transactions on Accessible Computing (TACCESS)       (Followers: 3) ACM Transactions on Algorithms (TALG)       (Followers: 16) ACM Transactions on Applied Perception (TAP)       (Followers: 6) ACM Transactions on Architecture and Code Optimization (TACO)       (Followers: 9) ACM Transactions on Autonomous and Adaptive Systems (TAAS)       (Followers: 7) ACM Transactions on Computation Theory (TOCT)       (Followers: 11) ACM Transactions on Computational Logic (TOCL)       (Followers: 4) ACM Transactions on Computer Systems (TOCS)       (Followers: 18) ACM Transactions on Computer-Human Interaction       (Followers: 13) ACM Transactions on Computing Education (TOCE)       (Followers: 3) ACM Transactions on Design Automation of Electronic Systems (TODAES)       (Followers: 1) ACM Transactions on Economics and Computation ACM Transactions on Embedded Computing Systems (TECS)       (Followers: 4) ACM Transactions on Information Systems (TOIS)       (Followers: 20) ACM Transactions on Intelligent Systems and Technology (TIST)       (Followers: 8) ACM Transactions on Interactive Intelligent Systems (TiiS)       (Followers: 3) ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)       (Followers: 10) ACM Transactions on Reconfigurable Technology and Systems (TRETS)       (Followers: 7) ACM Transactions on Sensor Networks (TOSN)       (Followers: 8) ACM Transactions on Speech and Language Processing (TSLP)       (Followers: 11) ACM Transactions on Storage ACS Applied Materials & Interfaces       (Followers: 21) Acta Automatica Sinica       (Followers: 3) Acta Universitatis Cibiniensis. Technical Series Ad Hoc Networks       (Followers: 11) Adaptive Behavior       (Followers: 11) Advanced Engineering Materials       (Followers: 26) Advanced Science Letters       (Followers: 7) Advances in Adaptive Data Analysis       (Followers: 8) Advances in Artificial Intelligence       (Followers: 16) Advances in Calculus of Variations       (Followers: 2) Advances in Catalysis       (Followers: 5) Advances in Computational Mathematics       (Followers: 15) Advances in Computer Science : an International Journal       (Followers: 13) Advances in Computing       (Followers: 2) Advances in Data Analysis and Classification       (Followers: 53) Advances in Engineering Software       (Followers: 25) Advances in Geosciences (ADGEO)       (Followers: 10) Advances in Human-Computer Interaction       (Followers: 20) Advances in Materials Sciences       (Followers: 16) Advances in Operations Research       (Followers: 11) Advances in Parallel Computing       (Followers: 7) Advances in Porous Media       (Followers: 4) Advances in Remote Sensing       (Followers: 37) Advances in Science and Research (ASR)       (Followers: 6) Advances in Technology Innovation       (Followers: 1) AEU - International Journal of Electronics and Communications       (Followers: 8) African Journal of Information and Communication       (Followers: 6) African Journal of Mathematics and Computer Science Research       (Followers: 4) Air, Soil & Water Research       (Followers: 7) AIS Transactions on Human-Computer Interaction       (Followers: 6) Algebras and Representation Theory       (Followers: 1) Algorithms       (Followers: 11) American Journal of Computational and Applied Mathematics       (Followers: 4) American Journal of Computational Mathematics       (Followers: 4) American Journal of Information Systems       (Followers: 7) American Journal of Sensor Technology       (Followers: 4) Anais da Academia Brasileira de CiÃªncias       (Followers: 2) Analog Integrated Circuits and Signal Processing       (Followers: 7) Analysis in Theory and Applications       (Followers: 1) Animation Practice, Process & Production       (Followers: 5) Annals of Combinatorics       (Followers: 3) Annals of Data Science       (Followers: 9) Annals of Mathematics and Artificial Intelligence       (Followers: 6) Annals of Pure and Applied Logic       (Followers: 2) Annals of Software Engineering       (Followers: 12) Annual Reviews in Control       (Followers: 6) Anuario Americanista Europeo Applicable Algebra in Engineering, Communication and Computing       (Followers: 2) Applied and Computational Harmonic Analysis       (Followers: 2) Applied Artificial Intelligence: An International Journal       (Followers: 14) Applied Categorical Structures       (Followers: 2) Applied Clinical Informatics       (Followers: 2) Applied Computational Intelligence and Soft Computing       (Followers: 12) Applied Computer Systems       (Followers: 1) Applied Informatics Applied Mathematics and Computation       (Followers: 32) Applied Medical Informatics       (Followers: 10) Applied Numerical Mathematics       (Followers: 5) Applied Soft Computing       (Followers: 16) Applied Spatial Analysis and Policy       (Followers: 4) Architectural Theory Review       (Followers: 3) Archive of Applied Mechanics       (Followers: 5) Archive of Numerical Software Archives and Museum Informatics       (Followers: 124) Archives of Computational Methods in Engineering       (Followers: 4) Artifact       (Followers: 2) Artificial Life       (Followers: 6) Asia Pacific Journal on Computational Engineering Asia-Pacific Journal of Information Technology and Multimedia       (Followers: 1) Asian Journal of Computer Science and Information Technology Asian Journal of Control Assembly Automation       (Followers: 2) at - Automatisierungstechnik       (Followers: 1) Australian Educational Computing Automatic Control and Computer Sciences       (Followers: 3) Automatic Documentation and Mathematical Linguistics       (Followers: 5) Automatica       (Followers: 9) Automation in Construction       (Followers: 6) Autonomous Mental Development, IEEE Transactions on       (Followers: 8) Basin Research       (Followers: 5) Behaviour & Information Technology       (Followers: 52) Bioinformatics       (Followers: 307) Biomedical Engineering       (Followers: 16) Biomedical Engineering and Computational Biology       (Followers: 13) Biomedical Engineering, IEEE Reviews in       (Followers: 17) Biomedical Engineering, IEEE Transactions on       (Followers: 31) Briefings in Bioinformatics       (Followers: 46) British Journal of Educational Technology       (Followers: 124) Broadcasting, IEEE Transactions on       (Followers: 10) c't Magazin fuer Computertechnik       (Followers: 2) CALCOLO Calphad Canadian Journal of Electrical and Computer Engineering       (Followers: 14) Catalysis in Industry       (Followers: 1) CEAS Space Journal Cell Communication and Signaling       (Followers: 1) Central European Journal of Computer Science       (Followers: 5) CERN IdeaSquare Journal of Experimental Innovation Chaos, Solitons & Fractals       (Followers: 3) Chemometrics and Intelligent Laboratory Systems       (Followers: 15) ChemSusChem       (Followers: 7) China Communications       (Followers: 7) Chinese Journal of Catalysis       (Followers: 2) CIN Computers Informatics Nursing       (Followers: 12) Circuits and Systems       (Followers: 16) Clean Air Journal       (Followers: 2) CLEI Electronic Journal Clin-Alert       (Followers: 1) Cluster Computing       (Followers: 1) Cognitive Computation       (Followers: 4) COMBINATORICA Combustion Theory and Modelling       (Followers: 13) Communication Methods and Measures       (Followers: 11) Communication Theory       (Followers: 20) Communications Engineer       (Followers: 1) Communications in Algebra       (Followers: 3) Communications in Partial Differential Equations       (Followers: 3) Communications of the ACM       (Followers: 53) Communications of the Association for Information Systems       (Followers: 18) COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering       (Followers: 3) Complex & Intelligent Systems Complex Adaptive Systems Modeling Complex Analysis and Operator Theory       (Followers: 2) Complexity       (Followers: 6) Complexus Composite Materials Series       (Followers: 9) Computación y Sistemas Computation Computational and Applied Mathematics       (Followers: 2) Computational and Mathematical Methods in Medicine       (Followers: 2) Computational and Mathematical Organization Theory       (Followers: 2) Computational and Structural Biotechnology Journal       (Followers: 2) Computational and Theoretical Chemistry       (Followers: 9) Computational Astrophysics and Cosmology       (Followers: 1) Computational Biology and Chemistry       (Followers: 12) Computational Chemistry       (Followers: 2) Computational Cognitive Science       (Followers: 2) Computational Complexity       (Followers: 4) Computational Condensed Matter Computational Ecology and Software       (Followers: 9) Computational Economics       (Followers: 9) Computational Geosciences       (Followers: 14) Computational Linguistics       (Followers: 23) Computational Management Science Computational Mathematics and Modeling       (Followers: 8) Computational Mechanics       (Followers: 4) Computational Methods and Function Theory Computational Molecular Bioscience       (Followers: 2) Computational Optimization and Applications       (Followers: 7) Computational Particle Mechanics       (Followers: 1) Computational Research       (Followers: 1) Computational Science and Discovery       (Followers: 2) Computational Science and Techniques Computational Statistics       (Followers: 13) Computational Statistics & Data Analysis       (Followers: 31) Computer       (Followers: 84) Computer Aided Surgery       (Followers: 3) Computer Applications in Engineering Education       (Followers: 6) Computer Communications       (Followers: 10) Computer Engineering and Applications Journal       (Followers: 5) Computer Journal       (Followers: 7) Computer Methods in Applied Mechanics and Engineering       (Followers: 22) Computer Methods in Biomechanics and Biomedical Engineering       (Followers: 10) Computer Methods in the Geosciences       (Followers: 1) Computer Music Journal       (Followers: 16) Computer Physics Communications       (Followers: 6) Computer Science - Research and Development       (Followers: 7) Computer Science and Engineering       (Followers: 17) Computer Science and Information Technology       (Followers: 11) Computer Science Education       (Followers: 12) Computer Science Journal       (Followers: 20) Computer Science Master Research       (Followers: 10) Computer Science Review       (Followers: 10)
 Annals of Combinatorics   [SJR: 0.849]   [H-I: 15]   [3 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 0219-3094 - ISSN (Online) 0218-0006    Published by Springer-Verlag  [2353 journals]
• Arithmetic Properties of m -ary Partitions Without Gaps
• Abstract: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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

• Two Partition Functions with Congruences Modulo 3,5,7, and 13
• Authors: Chris Jennings-Shaffer
Abstract: Abstract We introduce two new integer partition functions, both of which are the number of partition quadruples of n with certain size restrictions. We prove both functions satisfy Ramanujan-type congruences modulo 3, 5, 7, and 13 by use of generalized Lambert series identities and q-series techniques.
PubDate: 2017-07-26
DOI: 10.1007/s00026-017-0359-8

• Combinatorial Proof of a Partition Inequality of Bessenrodt-Ono
• Authors: Abdulaziz A. Alanazi; Stephen M. Gagola; Augustine O. Munagi
Abstract: Abstract We provide a combinatorial proof of the inequality $${p(a)p(b) > p(a+b)}$$ , where p(n) is the partition function and a, $${b > 1}$$ are integers satisfying $${a+b > 9}$$ . This problem was posed by Bessenrodt and Ono who used the inequality to study a new multiplicative property of an extended partition function [Ann. Combin. 20, 59–64 (2016)].
PubDate: 2017-07-21
DOI: 10.1007/s00026-017-0358-9

• A Combinatorial Proof of the Smoothness of Catalecticant Schemes
Associated to Complete Intersections
• Authors: Alexander Isaev
Abstract: Abstract For zero-dimensional complete intersections with homogeneous ideal generators of equal degrees over an algebraically closed field of characteristic zero, we give a combinatorial proof of the smoothness of the corresponding catalecticant schemes along an open subset of a particular irreducible component.
PubDate: 2017-07-14
DOI: 10.1007/s00026-017-0357-x

• Moments of Normally Distributed Random Matrices Given by Generating Series
for Connection Coefficients — Explicit Bijective Computation
• Authors: Ekaterina Vassilieva
Abstract: Abstract This paper is devoted to the explicit computation of some generating series for the connection coefficients of the double cosets of the hyperoctahedral group that arise in the study of the spectra of normally distributed random matrices. Aside their direct algebraic and combinatorial interpretations in terms of factorizations of permutations with specific properties, these connection coefficients are closely linked to the theory of zonal spherical functions and zonal polynomials. As shown by Hanlon, Stanley, Stembridge (1992), their generating series in the basis of power sum symmetric functions is equal to the mathematical expectation of the trace of (XUYU t ) n where X and Y are given symmetric matrices, U is a random real valued square matrix of standard normal distribution and n a non-negative integer. We provide the first explicit evaluation of these series in terms of monomial symmetric functions. Our development relies on an interpretation of the connection coefficients in terms of locally orientable hypermaps and a new bijective construction between partitioned locally orientable hypermaps and some decorated forests. As a corollary we provide a simple explicit evaluation of a similar generating series that gives the mathematical expectation of the trace of (XUYU*) n when U is complex valued and X and Y are given hermitian matrices and recover a former result by Morales and Vassilieva (2009).
PubDate: 2017-07-07
DOI: 10.1007/s00026-017-0356-y

• On the Multiplicity-Free Plethysms p 2 [ $${s_\lambda}$$ s λ ]
• Authors: Luisa Carini
Abstract: Abstract We determine all the shapes $${\lambda}$$ such that the plethysms $${p_2}$$ [ $${s_\lambda}$$ ](x) of the power symmetric function $${p_2}$$ (x) and the Schur function $${s_\lambda}$$ (x) are multiplicity-free.
PubDate: 2017-07-06
DOI: 10.1007/s00026-017-0354-0

• Primary Components of Codimension Two Lattice Basis Ideals
• Authors: Zekiye Sahin Eser; Laura Felicia Matusevich
Abstract: Abstract We provide explicit combinatorial descriptions of the primary components of codimension two lattice basis ideals. As an application, we compute the set of parameters for which a bivariate Horn system of hypergeometric differential equations is holonomic.
PubDate: 2017-07-06
DOI: 10.1007/s00026-017-0355-z

• Homotopy Types of Frobenius Complexes
• Authors: Shouta Tounai
Abstract: Abstract Let Λ be a submonoid of the additive monoid $${\mathbb{N}}$$ . There is a natural order on Λ defined by $${\lambda \leq \lambda +\mu}$$ for $${\lambda,\mu \in \Lambda}$$ . A Frobenius complex of Λ is defined to be the order complex of an open interval of Λ. Suppose $${r \geq 2}$$ and let $${\rho}$$ be a reducible element of Λ. We construct the additive monoid $${\Lambda[\rho/r]}$$ obtained from Λ by adjoining a solution to the equation $${r\alpha=\rho}$$ . We show that any Frobenius complex of $${\Lambda[\rho/r]}$$ is homotopy equivalent to a wedge of iterated suspensions of Frobenius complexes of Λ. As a consequence, we derive a formula for the multi-graded Poincaré series associated to $${\Lambda[\rho/r]}$$ . As an application, we determine the homotopy types of the Frobenius complexes of some additive monoids. For example, we show that if Λ is generated by a finite geometric sequence, then any Frobenius complex of Λ is homotopy equivalent to a wedge of spheres.
PubDate: 2017-05-17
DOI: 10.1007/s00026-017-0353-1

• The Enumeration of Permutations Avoiding 3124 and 4312
• Authors: Jay Pantone
Abstract: Abstract We find the generating function for the class of all permutations that avoid the patterns 3124 and 4312 by showing that it is an inflation of the union of two geometric grid classes.
PubDate: 2017-05-12
DOI: 10.1007/s00026-017-0352-2

• Sharp Concentration Inequalities for Deviations from the Mean for Sums of
Independent Rademacher Random Variables
• Authors: Harrie Hendriks; Martien C. A. van Zuijlen
Abstract: Abstract For a fixed unit vector $${a = (a_1, a_2,..., a_n) \in S^{n-1}}$$ , that is, $${\sum^n_{i=1} a^2_1 = 1}$$ , we consider the 2 n signed vectors $${\varepsilon = (\varepsilon_1, \varepsilon_2,..., \varepsilon_n) \in \{-1, 1\}^n}$$ and the corresponding scalar products $${a \cdot \varepsilon = \sum^n_{i=1} a_i \varepsilon_i}$$ . In [3] the following old conjecture has been reformulated. It states that among the 2 n sums of the form $${\sum \pm a_i}$$ there are not more with $${ \sum^n_{i=1} \pm a_i > 1}$$ than there are with $${ \sum^n_{i=1} \pm a_i \leq 1}$$ . The result is of interest in itself, but has also an appealing reformulation in probability theory and in geometry. In this paper we will solve an extension of this problem in the uniform case where $${a_1 = a_2 = \cdot\cdot\cdot = a_n = n^{-1/2}}$$ . More precisely, for S n being a sum of n independent Rademacher random variables, we will give, for several values of $${\xi}$$ , precise lower bounds for the probabilities $$P_n: = \mathbb{P} \{-\xi \sqrt{n} \leq S_n \leq \xi \sqrt{n}\}$$ or equivalently for $$Q_n: = \mathbb{P} \{-\xi \leq T_n \leq \xi \},$$ where $${T_n}$$ is a standardized binomial random variable with parameters n and $${p = 1/2}$$ . These lower bounds are sharp and much better than for instance the bound that can be obtained from application of the Chebyshev inequality. In case $${\xi = 1}$$ Van Zuijlen solved this problem in [5]. We remark that our bound will have nice applications in probability theory and especially in random walk theory (cf. [1, 2]).
PubDate: 2017-05-11
DOI: 10.1007/s00026-017-0351-3

• Generalized Polarization Modules
• Authors: Héctor Blandin
Abstract: Abstract This work enrols the research line of M. Haiman on the Operator Theorem (the former Operator Conjecture). Given a $${\mathfrak{S}_n}$$ -stable family F of homogeneous polynomials in the variables $${x_i j}$$ with $${1 \leq i \leq \ell}$$ and $${1 \leq j \leq n}$$ . We define the polarization module generated by the family F, as the smallest vector space closed under taking partial derivatives and closed under the action of polarization operators that contains F. These spaces are representations of the direct product $${\mathfrak{S}_n \times GL_\ell(\mathbb{C})}$$ . We compute the graded Frobenius characteristic of these modules. We use some basic tools to study these spaces and give some in-depth calculations of low degree examples of a family or a single symmetric polynomial.
PubDate: 2017-04-28
DOI: 10.1007/s00026-017-0350-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.158.21.176

About JournalTOCs
API
Help
News (blog, publications)

JournalTOCs © 2009-2016