Search Results

You are looking at 1 - 10 of 19 items for :

  • Theoretical Computer Sciences x
Clear All
Open access

Niccoló Castronuovo

References [1] R. M. Adin and Y. Roichman, Equidistribution and sign-balance on 321-avoiding permuta- tions, Sém. Lothar. Combin., 51 (2004) Article B51d. [2] E. Barcucci, A. Bernini, L. Ferrari and M. Poneti, A distributive lattice structure con- necting Dyck paths, noncrossing partitions and 312-avoiding permutations, Order, 22 (2005) 311-328. [3] E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, ECO: a methodology for the Enumeration of Combinatorial Objects, J. Difference Equ. Appl., 5 (1999) 435

Open access

David Callan and Toufik Mansour

-letter patterns I , Discrete Math. Theoret. Comput. Sci., 19:1 (2017) #5, 35 pp. [9] D. C allan , T. M ansour and M. S hattuck , Wilf classification of triples of 4-letter patterns II , Discrete Math. Theoret. Comput. Sci., 19:1 (2017) #6, 44 pp. [10] G. F irro and T. M ansour , Three-letter-pattern avoiding permutations and functional equations , Electron. J. Combin., 13 (2006) #R51. [11] D. E. K nuth , The Art of Computer Programming , 3rd edition, Addison Wesley, Reading, MA, 1997. [12] T. M ansour and A. V ainshtein , Restricted 132

Open access

Emanuele Munarini

) 317–322. [5] L. C arlitz , Fibonacci notes 4: q-Fibonacci polynomials , Fibonacci Quart., 13 (1975) 97–102. [6] I. J. G ood , A symmetry property of alternating sums of products of reciprocals , Fibonacci Quart., 32 (1994) 284–287. [7] A. M. G oyt and B. E. S agan , Set partition statistics and q-Fibonacci numbers , European J. Combin., 30 (2009) 230–245. [8] A. F. H oradam , Basic properties of a certain generalized sequence of numbers , Fibonacci Quart., 3 (1965) 161–176. [9] A. F. H oradam , Generating functions for powers of a

Open access

Somdeb Lahiri

: “Price duopoly and capacity constraints”, International Economic Review 13 (1972): 111-122. [13] Novshek, W. : “Perfectly competitive markets as the limits of Cournot markets”, Journal of Economic Theory, 35 (1985): 72-82. [14] Shapley, L.S. : “Non-cooperative general exchange”, in S.A.Y. Lin (ed.), Theory of measurement of economic externalities, Academic Press, New York (1976). [15] Shapley, L.S. and M. Shubik : “Trade using one commodity as a means of payment”, Journal of Political Economy 85 (1977), 937-968. [16] Shubik, M. : “Commodity

Open access

Toufik Mansour and Mark Shattuck

. J. Schuster, Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences, J. Combin. Theory Ser. A, 119 (2012) 850-870. [10] R. Simion and F. W. Schmidt, Restricted permutations, European J. Combin., 6 (1985) 383-406. [11] N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, at http://oeis.org, 2010. [12] R. P. Stanley, Enumerative Combinatorics, Vol. I, Cambridge University Press, 1997. [13] D. Zeilberger, Enumeration schemes, and more importantly, their

Open access

Apáthy M. Sándor

References [1] R. A itken , Wilderness Areas in Scotland , PhD thesis, unpublished Ph.D. Thesis. University of Aberdeen, Aberdeen, 1977. [2] M. S. G oh , D. F. S hen , and S. H. H ong , Processing of gps data with difference hdop in guide robot for the visually impaired , International Journal of Computer Science and Network Security, 7 (2007), pp. 90–97. [3] M. G ulliksson and P. W edin , Modifying the qr-decomposition to constrained and weighted linear least squares , SIAM Journal on Matrix Analysis and Applications, 13 (1992), pp

Open access

Antonio Bernini, Stefano Bilotta, Elisa Pergola and Renzo Pinzani

overlaps, pattern matching, and nontransitive games, J. Combin. Theory Ser. A, 30 (1981) 183-208. [13] K. H. Kim, M. S. Putcha and F. W. Roush, Some combinatorial properties of free semi- groups, J. London Math. Soc., 16 (1977) 397-402. [14] S. Kumar and E. H. Spafford, A pattern matching model for misuse intrusion detection, In Proc. NCSC 1994, 11-21. [15] P. T. Nielsen, A Note on Bifix-Free Sequences, IEEE Trans. Inform. Theory, 29 (1973) 704-706. [16] I. Rigoutsos, A. Floratos, L. Parida, Y. Gao and D

Open access

Massimo Angrisani and Cinzia di Palo

Publications, 2012. [10] Human Mortality Database. Data on mortality. Book, University of California, Berkeley (USA) and Max Planck Institute for Demographic Research (Germany). Available at www.humanmortality.de , (data downloaded 2012). [11] M. KNELL. Pay-As-You-Go A Relict from the Past or a Promise for the Future. Winning contribution of the Hannes Androsch Prize , 2011. [12] R. LEE. The demographic transition: Three centuries of fundamental change. Journal of Economic Perspectives , 17(4):167–190, 2003. [13] F. MODIGLIANI, M. CEPRINI, and L

Open access

Jean-Luc Baril and Armen Petrossian

paths, Adv. in Appl. Math., 27 (2001) 510-530. [10] T. Mansour, Combinatorics of Set Partitions, Discrete Mathematics and its Applications, Chapman & Hall/CRC, 2013. [11] T. Mansour, Permutations avoiding a pattern from Sk and at least two patterns from S3, Ars. Combin., 62 (2002) 227-239. [12] T. Mansour and A. Vainshtein, Restricted 132-avoiding permutations, Adv. Appl. Math., 26 (2001) 258-269. [13] R. Simion and F.W. Schmidt, Restricted permutations, European J. Combin., 6 (1985) 383

Open access

Ljuben Mutafchiev

., 22 (2013) 433-454. [13] L. Mutafchiev, Sampling part sizes of random integer partitions, Ramanujan J., 37 (2015) 329-343. [14] H. Rademacher, On the partition function p(n), Proc. London Math. Soc., 43 (1937) 241-254. [15] V. N. Sachkov, Combinatorial Methods in Discrete Mathematics, Encyclopedia of Mathematics and its Applications, 55, Cambridge University Press, Cambridge, 1999. [16] H. Wilf, Three problems in combinatorial analysis, J. Combin. Theory Ser. A, 35 (1983) 199-207.