Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order

2016 ◽  
pp. 505-518 ◽  
Author(s):  
Kung-Jui Pai ◽  
Ro-Yu Wu ◽  
Jou-Ming Chang ◽  
Shun-Chieh Chang
Keyword(s):  
Lexicographic Order ◽  
Left Child

Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order

2019 ◽  
Vol 268 ◽  
pp. 223-236 ◽  
Author(s):  
Kung-Jui Pai ◽  
Jou-Ming Chang ◽  
Ro-Yu Wu ◽  
Shun-Chieh Chang
Keyword(s):  
Lexicographic Order ◽  
Left Child

Using hashing and lexicographic order for Frequent Itemsets Mining on data streams

2019 ◽  
Vol 125 ◽  
pp. 58-71 ◽  
Author(s):  
Lázaro Bustio-Martínez ◽  
Martín Letras-Luna ◽  
René Cumplido ◽  
Raudel Hernández-León ◽  
Claudia Feregrino-Uribe ◽  
...  
Keyword(s):  
Data Streams ◽  
Lexicographic Order ◽  
Frequent Itemsets ◽  
Frequent Itemsets Mining

scholarly journals On a Positivity Conjecture in the Character Table of $S_n$

10.37236/8186 ◽  
2019 ◽  
Vol 26 (1) ◽  
Author(s):  
Sheila Sundaram
Keyword(s):  
Lexicographic Order ◽  
Character Table ◽  
Power Sums ◽  
Special Cases ◽  
Schur Positive

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this conjecture and establish its truth in the following special cases: for $\mu\in [(n-4,1^4), (n)]$  or $\mu\in [(1^n), (3,1^{n-3})], $ or $\mu=(3, 2^k, 1^r)$ when $k\geq 1$ and $0\leq r\leq 2.$  Many new Schur positivity questions are presented.

scholarly journals Most Probably Intersecting Hypergraphs

10.37236/4784 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Shagnik Das ◽  
Benny Sudakov
Keyword(s):  
Initial Segment ◽  
Lexicographic Order ◽  
Structural Characterisation ◽  
Intersecting Families ◽  
Intersecting Hypergraphs

The celebrated Erdős-Ko-Rado theorem shows that for $n \ge 2k$ the largest intersecting $k$-uniform set family on $[n]$ has size $\binom{n-1}{k-1}$. It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting.We consider the most probably intersecting problem for $k$-uniform set families. We provide a rough structural characterisation of the most probably intersecting families and, for families of particular sizes, show that the initial segment of the lexicographic order is optimal.

scholarly journals Some Characterizations of Sturmian Words in Terms of the Lexicographic Order

2012 ◽  
Vol 116 (1-4) ◽  
pp. 25-33 ◽  
Author(s):  
Michelangelo Bucci ◽  
Alessandro De Luca ◽  
Luca Q. Zamboni
Keyword(s):  
Lexicographic Order ◽  
Sturmian Words

scholarly journals Short Notes: Permutation Backtracking in Lexicographic Order

1984 ◽  
Vol 27 (4) ◽  
pp. 373-375 ◽  
Author(s):  
R. W. Irving
Keyword(s):  
Lexicographic Order

scholarly journals Indispensable Hibi Relations and Gröbner Bases

2015 ◽  
Vol 22 (04) ◽  
pp. 567-580
Author(s):  
Ayesha Asloob Qureshi
Keyword(s):  
Gröbner Basis ◽  
Gröbner Bases ◽  
Lexicographic Order ◽  
Grobner Bases ◽  
Grobner Basis ◽  
Ideal Lattices ◽  
The Ideal

In this paper we consider Hibi rings and Rees rings attached to a poset. We classify the ideal lattices of posets whose Hibi relations are indispensable and the ideal lattices of posets whose Hibi relations form a quadratic Gröbner basis with respect to the rank lexicographic order. Similar classifications are obtained for Rees rings of Hibi ideals.

Sign in / Sign up

Export Citation Format

Share Document