Filters








3,413 Hits in 5.2 sec

Flattening Antichains with Respect to the Volume

Ljiljana Brankovic, Paulette Lieby, Mirka Miller
1998 Electronic Journal of Combinatorics  
Define the volume of $\cal A$ to be $\sum_{A\in{\cal A}}|A|$. We prove that for every antichain $\cal A$ in $B_n$ there exist an antichain which is flat and has the same volume as $\cal A$.  ...  We say that an antichain $\cal A$ in the boolean lattice $B_n$ is flat if there exists an integer $k\geq 0$ such that every set in $\cal A$ has cardinality either $k$ or $k+1$.  ...  The proof the electronic journal of combinatorics 6 (1999), #R1 of Theorem 1 concludes by showing that all the latter antichains can be flattened while keeping size and volume constant.  ... 
doi:10.37236/1433 fatcat:vtzuoyiap5atzo2dft3pdg357y

On the Volumes and Affine Types of Trades

Ebrahim Ghorbani, Sara Kamali, Gholamreza B. Khosrovshahi, Denis Krotov
2020 Electronic Journal of Combinatorics  
Further, we derive the spectrum of volumes of simple trades up to $2.5\cdot 2^t$, extending the known result for volumes less than $2\cdot 2^t$.  ...  ., those with no repeated blocks) correspond to a Boolean function of degree at most $v-t-1$.  ...  The research of the fourth author was supported by the Program of fundamental scientific researches of the SB RAS No.I.5.1. (project No. 0314-2019-0016).  ... 
doi:10.37236/8367 fatcat:fhjlajinozdghi5ibgf7g34lwq

A Short Proof, Based on Mixed Volumes, of Liggett's Theorem on the Convolution of Ultra-Logconcave Sequences

Leonid Gurvits
2009 Electronic Journal of Combinatorics  
We present here a short proof, based on the mixed volume of convex sets.  ...  Liggett proved in 1997, that the convolution of two ultra-logconcave is ultra-logconcave. Liggett's proof is elementary but long.  ...  Acknowledgements The author is indebted to the both anonymous reviewers for a careful and thoughtful reading of the original version of this paper.  ... 
doi:10.37236/243 fatcat:wojfrleds5bnpnxm6uucqbujia

Publisher's Note

2003 European journal of combinatorics (Print)  
Christopher Leonard Publishing Editor Email: c.leonard@elsevier.com www.elsevier.com/locate/ejc Publisher's Note / European Journal of Combinatorics 24 (2003) 1-3  ...  Author Gateway www.authors.elsevier.com The Author Gateway, for The European Journal of Combinatorics accessible at http://authors.elsevier.com/journal/ejc, provides: • Electronic submission guidance  ... 
doi:10.1016/s0195-6698(02)00141-5 fatcat:mcvpgetdhzdpxmkpjrdzleb7ye

How many Faces can the Polycubes of Lattice Tilings by Translation of ${\mathbb R}^3$ have?

I. Gambini, L. Vuillon
2011 Electronic Journal of Combinatorics  
Nevertheless, we are able to construct a class of more complicated polycubes such that each polycube tiles the space in a unique way and such that the number of faces is $4k+8$ where $2k+1$ is the volume  ...  of the polycube.  ...  We are also grateful to the anonymous referees for their helpful comments. the electronic journal of combinatorics 18 (2011), #P199  ... 
doi:10.37236/686 fatcat:3g4d3bhttbal5a5h6fizmpc6uq

JSL volume 87 issue 1 Cover and Front matter

2022 Journal of Symbolic Logic (JSL)  
They should also consult the more general guidelines for the submission of manuscripts at https://aslonline.org/journals/the-journal-of-symbolic-logic/submission-guidelines/.  ...  These instructions include the Association's standards about previous publication and plagiarism as well as information about copyrights and electronic copies of published papers.  ...  TABLE OF CONTENTS OF Model theory and combinatorics of banned sequences Hunter CHase and James Freitag .................................................................. 1 The tree of tuples of a structure  ... 
doi:10.1017/jsl.2022.19 fatcat:qx5wizot2nawll2tqcx5xantfi

CPC volume 4 issue 2 Cover and Back matter

1995 Combinatorics, probability & computing  
The lectures survey many topical areas of current research activity in combinatorics and its applications, and also provide a valuable overview of the subject, for both mathematicians and computer scientists  ...  WALKER This volume comprises the invited lectures given at the 14th British Combinatorial Conference.  ...  journal welcomes submissions in any of the areas of Combinatorics, Probability, or Computer Science, not just those dealing explicitly with relations between the three.  ... 
doi:10.1017/s0963548300001516 fatcat:cyxifozpe5fhhfpjazxosanpn4

A Continuous Analogue of Lattice Path Enumeration

Quang-Nhat Le, Sinai Robins, Christophe Vignat, Tanay Wakhare
2019 Electronic Journal of Combinatorics  
Following the work of Cano and Díaz, we consider a continuous analog of lattice path enumeration.  ...  Finally, as an important byproduct of these continuous analogs, we illustrate a general method to recover discrete combinatorial quantities from their continuous analogs, via an application of the Khovanski-Puklikov  ...  journal of combinatorics 26(3) (2019), #P3.57 the electronic journal of combinatorics 26(3) (2019), #P3.57 the electronic journal of combinatorics 26(3) (2019), #P3.57 the electronic journal  ... 
doi:10.37236/8788 fatcat:h7j7n3tvlfaqxcoxf7wf5iddoy

Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter

Winston C. Yang
2006 Electronic Journal of Combinatorics  
A layer is the set of grid cells that are vertex-adjacent to the polyform and not part of the polyform. A bumped-body polyform has two parts: a body and a bump.  ...  In two dimensions, a polyform is a finite set of edge-connected cells on a square, triangular, or hexagonal grid.  ...  f + |x + 2 ).the electronic journal of combinatorics 13 (2006), Calculating the area of a BB polyiamond (a, b, c, d, e, f |x).  ... 
doi:10.37236/1032 fatcat:txjii23yf5bhjig43hj2zc6iwe

CPC volume 4 issue 3 Cover and Back matter

1995 Combinatorics, probability & computing  
working in language development or formal methods Subscription information Instructions for Authors Editorial policy The journal welcomes submissions in any of the areas of Combinatorics, Probability  ...  of Scientific Periodicals (4th edn); volume number; inclusive page numbers.  ... 
doi:10.1017/s0963548300001589 fatcat:xzhhwzyvdfhprnkm6vgivrievm

Eulerian-Catalan Numbers

Hoda Bidkhori, Seth Sullivant
2011 Electronic Journal of Combinatorics  
We provide two proofs for this fact, the first using the geometry of alcoved polytopes and the second a direct combinatorial proof via an Eulerian-Catalan analogue of the Chung-Feller theorem.  ...  We show that the Eulerian-Catalan numbers enumerate Dyck permutations.  ...  =1 x s ≥ t, t ∈ T, 2t s=1 x s ≤ t, t ∈ [n] \ T .the electronic journal of combinatorics 18 (2011), #P187 the electronic journal of combinatorics 18 (2011), #P187  ... 
doi:10.37236/674 fatcat:lxcaegnsincbrh6o6q6cbahiam

CPC volume 5 issue 4 Cover and Back matter

1996 Combinatorics, probability & computing  
Editorial policy The journal welcomes submissions in any of the areas of Combinatorics, Probability, or Computer Science, not just those dealing explicitly with relations between the three.  ...  structures; and the theory of algorithms, including complexity theory, randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation. https://www.cambridge.org  ...  of Scientific Periodicals (4th edn); volume number; inclusive page numbers.  ... 
doi:10.1017/s096354830000208x fatcat:jgqn6xjoajholobzsbtqsh47be

Page 7604 of Mathematical Reviews Vol. , Issue 2000k [page]

2000 Mathematical Reviews  
ISBN 0-521-56069-1 Volume | of Stanley’s Enumerative combinatorics appeared in 1986 [Wadsworth & Brooks/Cole Adv.  ...  (English summary) Electron. J. Combin. 6 (1999), no. 1, Research Paper 40, 13 pp. (electronic). Like the Fibonacci numbers, the numbers f,, = ((1 + /2)"+! + (1 — /2)"*!)  ... 

Crossings in Grid Drawings

Vida Dujmović, Pat Morin, Adam Sheffer
2014 Electronic Journal of Combinatorics  
Finally, for $d\ge 4$ the upper bound implies that the maximum number of crossing-free geometric graphs with vertices on some $d$-dimensional grid of volume $N$ is $N^{\Theta(N)}$.  ...  We prove tight crossing number inequalities for geometric graphs whose vertex sets are taken from a $d$-dimensional grid of volume $N$ and give applications of these inequalities to counting the number  ...  ) is 2 Ω(N log N ) Open Problem 2 . 2 Find non-trivial bounds-2 o(N log N ) or 2 ω(N ) -on ncs 3 (N ). the electronic journal of combinatorics 21(1) (2014), #P1.41 the electronic journal of combinatorics  ... 
doi:10.37236/3025 fatcat:jnaxksfzxfbh3il75dge5wkle4

CPC volume 1 issue 1 Cover and Back matter

1992 Combinatorics, probability & computing  
Write for more information and a free sample copy to Journals  ...  Instructions for Authors Editorial policy The journal welcomes submissions in any of the areas of Combinatorics, Probability, or Computer Science, not just those dealing explicitly with relations between  ...  of Scientific Periodicals (4th edn); volume number; inclusive page numbers.  ... 
doi:10.1017/s096354830000002x fatcat:s6ty7nleffdtlek2kqfms3njgi
« Previous Showing results 1 — 15 out of 3,413 results