Výsledky vyhledávání - Exact enumeration problems, generating functions

  1. 1
  2. 2

    Heuristic Logic Resynthesis Algorithms at the Core of Peephole Optimization Autor Lee, Siang-Yun, Micheli, Giovanni De

    ISSN: 0278-0070, 1937-4151
    Vydáno: New York IEEE 01.11.2023
    “… While exact methods such as enumeration and SATbased synthesis guarantee optimal solutions, limitations on the problem size are inevitable due to scalability concerns…”
    Získat plný text
    Journal Article
  3. 3

    Generalization to d-dimensions of a fermionic path integral for exact enumeration of polygons on hypercubic lattices Autor Ostilli, M., Rocha, G. W. C., Bezerra, C. G., Viswanathan, G. M.

    ISSN: 2045-2322, 2045-2322
    Vydáno: London Nature Publishing Group UK 27.09.2024
    Vydáno v Scientific reports (27.09.2024)
    “… On the cubic and hypercubic lattices the generating function is still unknown and the problem remains open…”
    Získat plný text
    Journal Article
  4. 4

    Distributions of successions of arbitrary multisets Autor Kong, Yong

    ISSN: 0361-0926, 1532-415X
    Vydáno: Philadelphia Taylor & Francis 19.03.2022
    “…By using the matrix formulation of the two-step approach to distributions of patterns in random sequences, recurrence and explicit formulas for the generating functions of successions in random…”
    Získat plný text
    Journal Article
  5. 5

    Enumeration of three-quadrant walks via invariants: some diagonally symmetric models Autor Bousquet-Mélou, Mireille

    ISSN: 0008-414X, 1496-4279
    Vydáno: Canada Canadian Mathematical Society 01.10.2023
    Vydáno v Canadian journal of mathematics (01.10.2023)
    “… Most of these results deal with the nature of the associated generating function: for which models is it algebraic, D-finite, D-algebraic…”
    Získat plný text
    Journal Article
  6. 6

    On the Joint Distributions of Increasing and Decreasing Successions of Arbitrary Multisets Autor Kong, Yong

    ISSN: 1387-5841, 1573-7713
    Vydáno: New York Springer US 01.09.2025
    “… Using the two-step approach to pattern distributions in random sequences previously developed by the author, we derive recurrence and explicit formulas for the generating functions of increasing…”
    Získat plný text
    Journal Article
  7. 7

    Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods Autor Dolecek, Lara, Anantharam, Venkat

    ISSN: 0895-4801, 1095-7146
    Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2010
    Vydáno v SIAM journal on discrete mathematics (01.01.2010)
    “…In this paper we study the problem of finding maximally sized subsets of binary strings (codes…”
    Získat plný text
    Journal Article
  8. 8

    On univariate optimal partitioning by complete enumeration Autor Aubry, Philippe

    ISSN: 2215-0161, 2215-0161
    Vydáno: Netherlands Elsevier B.V 01.01.2023
    Vydáno v MethodsX (01.01.2023)
    “…[Display omitted] Partitioning a set of elements into a given number of classes to find a globally optimal solution can be challenging due to the combinatorial explosion of the problem size…”
    Získat plný text
    Journal Article
  9. 9

    A direct method to obtain the joint distribution of successes, failures and patterns in enumeration problems Autor Antzoulakos, Demetrios L., Boutsikas, Michael V.

    ISSN: 0167-7152, 1879-2103
    Vydáno: Amsterdam Elsevier B.V 2007
    “…Let E be a pattern (single or composite) defined over a sequence of Bernoulli trials. Let X n , S n and F n be the number of occurrences of E , the number of…”
    Získat plný text
    Journal Article
  10. 10

    Exact counting of subtrees with diameter no more than d in trees: A generating function approach Autor Yang, Yu, Jin, Bang-Bang, Sun, Xiaoming, Zhang, Xiao-Dong, Li, Bo, Zhao, Kai, Wang, Hua

    ISSN: 0890-5401
    Vydáno: Elsevier Inc 01.11.2025
    Vydáno v Information and computation (01.11.2025)
    “…s. For an n-vertex tree T, by introducing novel generating functions with (d+2) variables, we propose an innovative algorithm for the exact enumeration of T's subtrees…”
    Získat plný text
    Journal Article
  11. 11

    Enumeration of L-convex polyominoes by rows and columns Autor Castiglione, G., Frosini, A., Restivo, A., Rinaldi, S.

    ISSN: 0304-3975, 1879-2294
    Vydáno: Amsterdam Elsevier B.V 30.11.2005
    Vydáno v Theoretical computer science (30.11.2005)
    “… In the last section, we present some open problems…”
    Získat plný text
    Journal Article
  12. 12

    New Results on Monotone Dualization and Generating Hypergraph Transversals Autor Eiter, Thomas, Gottlob, Georg, Makino, Kazuhisa

    ISSN: 0097-5397, 1095-7111
    Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2003
    Vydáno v SIAM journal on computing (01.01.2003)
    “…We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph…”
    Získat plný text
    Journal Article
  13. 13

    A history and a survey of lattice path enumeration Autor Humphreys, Katherine

    ISSN: 0378-3758, 1873-1171
    Vydáno: Kidlington Elsevier B.V 01.08.2010
    “…In celebration of the Sixth International Conference on Lattice Path Counting and Applications, it is befitting to review the history of lattice path enumeration and to survey how the topic has progressed thus far…”
    Získat plný text
    Journal Article Konferenční příspěvek
  14. 14

    Counting maps on doughnuts Autor Walsh, Timothy R.

    ISSN: 0304-3975, 1879-2294
    Vydáno: Elsevier B.V 02.09.2013
    Vydáno v Theoretical computer science (02.09.2013)
    “…? I solved this problem for doughnuts with up to 10 holes, and my colleagues Alain Giorgetti and Alexander Mednykh counted maps by number of edges alone on doughnuts with up to 11 holes…”
    Získat plný text
    Journal Article
  15. 15

    Computational aspects of monotone dualization: A brief survey Autor Eiter, Thomas, Makino, Kazuhisa, Gottlob, Georg

    ISSN: 0166-218X, 1872-6771
    Vydáno: Lausanne Elsevier B.V 06.06.2008
    Vydáno v Discrete Applied Mathematics (06.06.2008)
    “…Dualization of a monotone Boolean function represented by a conjunctive normal form (CNF…”
    Získat plný text
    Journal Article
  16. 16

    Chemical trees enumeration algorithms Autor Aringhieri, Roberto, Hansen, Pierre, Malucelli, Federico

    ISSN: 1619-4500, 1614-2411
    Vydáno: Heidelberg Springer Nature B.V 01.03.2003
    Vydáno v 4OR (01.03.2003)
    “… of fast enumeration algorithms. This paper considers the isomeric acyclic structures focusing on the enumeration of the alkane molecular family…”
    Získat plný text
    Journal Article
  17. 17

    Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps Autor Bóna, Miklós

    ISSN: 0097-3165, 1096-0899
    Vydáno: Elsevier Inc 01.11.1997
    “…Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating functionH(x…”
    Získat plný text
    Journal Article
  18. 18

    An elementary solution of Gessel's walks in the quadrant Autor Bousquet-Mélou, Mireille

    ISSN: 0001-8708, 1090-2082
    Vydáno: Elsevier Inc 05.11.2016
    “…) confined to the quadrant. The generating functions of such walks are archetypal solutions of partial discrete differential equations…”
    Získat plný text
    Journal Article
  19. 19
  20. 20

    On 3-Dimensional Lattice Walks Confined to the Positive Octant Autor Bostan, Alin, Bousquet-Mélou, Mireille, Kauers, Manuel, Melczer, Stephen

    ISSN: 0218-0006, 0219-3094
    Vydáno: Cham Springer International Publishing 01.12.2016
    Vydáno v Annals of combinatorics (01.12.2016)
    “… The classification is now complete for walks with steps in { 0 , ± 1 } 2 : the generating function is D-finite if and only if a certain group associated with the step set is finite…”
    Získat plný text
    Journal Article