scholarly journals An Inexact Combinatorial Model for Maximizing the Number of Discovered Nonzero Entries

2020 ◽  
pp. 32-42
Author(s):  
M. A. Rostami ◽  
H. M. Bücker
Keyword(s):  
Combinatorial Model

scholarly journals Types, Tokens, and Hapaxes: A New Heap’s Law

Glottotheory ◽  
2019 ◽  
Vol 9 (2) ◽  
pp. 113-129
Author(s):  
Victor Davis
Keyword(s):  
First Principles ◽  
Scaling Law ◽  
Written Language ◽  
Zipf’S Law ◽  
Academic Press ◽  
Zipf's Law ◽  
New Words ◽  
Size Dependent ◽  
Link Type ◽  
Combinatorial Model

Abstract Heap’s Law https://dl.acm.org/citation.cfm?id=539986 Heaps, H S 1978 Information Retrieval: Computational and Theoretical Aspects (Academic Press). states that in a large enough text corpus, the number of types as a function of tokens grows as N = K{M^\beta } for some free parameters K, \beta . Much has been written http://iopscience.iop.org/article/10.1088/1367-2630/15/9/093033 Font-Clos, Francesc 2013 A scaling law beyond Zipf’s law and its relation to Heaps’ law (New Journal of Physics 15 093033)., http://iopscience.iop.org/article/10.1088/1367-2630/11/12/123015 Bernhardsson S, da Rocha L E C and Minnhagen P 2009 The meta book and size-dependent properties of written language (New Journal of Physics 11 123015)., http://iopscience.iop.org/article/10.1088/1742-5468/2011/07/P07013 Bernhardsson S, Ki Baek and Minnhagen 2011 A paradoxical property of the monkey book (Journal of Statistical Mechanics: Theory and Experiment, Volume 2011)., http://milicka.cz/kestazeni/type-token_relation.pdf Milička, Jiří 2009 Type-token & Hapax-token Relation: A Combinatorial Model (Glottotheory. International Journal of Theoretical Linguistics 2 (1), 99–110)., https://www.nature.com/articles/srep00943 Petersen, Alexander 2012 Languages cool as they expand: Allometric scaling and the decreasing need for new words (Scientific Reports volume 2, Article number: 943). about how this result and various generalizations can be derived from Zipf’s Law. http://dx.doi.org/10.1037/h0052442 Zipf, George 1949 Human behavior and the principle of least effort (Reading: Addison-Wesley). Here we derive from first principles a completely novel expression of the type-token curve and prove its superior accuracy on real text. This expression naturally generalizes to equally accurate estimates for counting hapaxes and higher n-legomena.

scholarly journals Combinatorial model for the ferroelectric domain-network formation in hexagonal manganites

2014 ◽  
Vol 89 (2) ◽  
Author(s):  
Bruno Mettout ◽  
Pierre Tolédano ◽  
Martin Lilienblum ◽  
Manfred Fiebig
Keyword(s):  
Network Formation ◽  
Ferroelectric Domain ◽  
Combinatorial Model ◽  
Hexagonal Manganites

scholarly journals Combinatorics of k-shapes and Genocchi numbers

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Florent Hivert ◽  
Olivier Mallet
Keyword(s):  
Symmetric Functions ◽  
New Model ◽  
Work In Progress ◽  
Genocchi Numbers ◽  
Combinatorial Model ◽  
International Audience

International audience In this paper we present a work in progress on a conjectural new combinatorial model for the Genocchi numbers. This new model called irreducible k-shapes has a strong algebraic background in the theory of symmetric functions and leads to seemingly new features on the theory of Genocchi numbers. In particular, the natural q-analogue coming from the degree of symmetric functions seems to be unknown so far. Dans cet article, nous présentons un travail en cours sur un nouveau modèle combinatoire conjectural pour les nombres de Genocchi. Ce nouveau modèle est celui des k-formes irréductibles, qui repose sur de solides bases algébriques en lien avec la théorie des fonctions symétriques et qui conduit à des aspects apparemment nouveaux de la théorie des nombres de Genocchi. En particulier, le q-analogue naturel venant du degré des fonctions symétriques semble inconnu jusqu'ici.

scholarly journals The Cube Recurrence

10.37236/1826 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Gabriel D. Carroll ◽  
David Speyer
Keyword(s):  
Recurrence Relation ◽  
Planar Graphs ◽  
Perfect Matchings ◽  
Laurent Polynomials ◽  
Combinatorial Interpretation ◽  
Combinatorial Model

We construct a combinatorial model that is described by the cube recurrence, a quadratic recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in ${\Bbb Z}^3$. In the process, we prove several conjectures of Propp and of Fomin and Zelevinsky about the structure of these polynomials, and we obtain a combinatorial interpretation for the terms of Gale-Robinson sequences, including the Somos-6 and Somos-7 sequences. We also indicate how the model might be used to obtain some interesting results about perfect matchings of certain bipartite planar graphs.

Latest development of the combinatorial model of nuclear level densities

2011 ◽  
Author(s):  
S. Goriely ◽  
S. Hilaire ◽  
M. Girod ◽  
Paraskevi Demetriou ◽  
Rauno Julin ◽  
...  
Keyword(s):  
Nuclear Level ◽  
Level Densities ◽  
Combinatorial Model

scholarly journals CODES AND SHIFTED CODES

2012 ◽  
Vol 22 (06) ◽  
pp. 1250054
Author(s):  
J. T. HIRD ◽  
NAIHUAN JING ◽  
ERNEST STITZINGER
Keyword(s):  
Algebraic Structure ◽  
Schur Functions ◽  
Natural Setting ◽  
Bernstein Operators ◽  
Combinatorial Model

The action of the Bernstein operators on Schur functions was given in terms of codes by Carrell and Goulden (2011) and extended to the analog in Schur Q-functions in our previous work. We define a new combinatorial model of extended codes and show that both of these results follow from a natural combinatorial relation induced on codes. The new algebraic structure provides a natural setting for Schur functions indexed by compositions.

Sign in / Sign up

Export Citation Format

Share Document