×

Found 45 Documents (Results 1–45)

Candidate tree codes via Pascal determinant cubes. (English) Zbl 07768399

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 54, 22 p. (2021).
MSC:  94B60
PDFBibTeX XMLCite
Full Text: DOI

Testing polynomials for vanishing on Cartesian products of planar point sets. (English) Zbl 07760137

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 8, 14 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

On some tree-indexed series with one and two parameters. (English) Zbl 1445.05027

Burgos Gil, José Ignacio (ed.) et al., Periods in quantum field theory and arithmetic. Outcome of the “Research Trimester on Multiple Zeta Values, Multiple Polylogarithms, and Quantum Field Theory”, ICMAT 2014, Madrid, Spain, September 15–19, 2014. Cham: Springer. Springer Proc. Math. Stat. 314, 431-443 (2020).
MSC:  05C05 52B05 11B68
PDFBibTeX XMLCite
Full Text: DOI

A faster tree-decomposition based algorithm for counting linear extensions. (English) Zbl 1520.68218

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 5, 13 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Explicit binary tree codes with polylogarithmic size alphabet. (English) Zbl 1427.68141

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 535-544 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Probabilistic consequences of some polynomial recurrences. (English) Zbl 1441.05017

Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 12 p. (2016).
PDFBibTeX XMLCite
Full Text: arXiv

Structural and spectral properties of minimal strong digraphs. (English) Zbl 1356.05062

de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 91-96 (2016).
PDFBibTeX XMLCite
Full Text: DOI Link

A lower bound for computing Lagrange’s real root bound. (English) Zbl 1453.26010

Gerdt, Vladimir P. (ed.) et al., Computer algebra in scientific computing. 18th international workshop, CASC 2016, Bucharest, Romania, September 19–23, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9890, 444-456 (2016).
MSC:  26C10 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Genetics of polynomials over local fields. (English) Zbl 1396.11143

Ballet, Stéphane (ed.) et al., Algorithmic arithmetic, geometry, and coding theory. 14th international conference on arithmetic, geometry, cryptography, and coding theory (AGCT), CIRM, Marseille, France, June 3–7, 2013. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-1461-0/pbk; 978-1-4704-2339-1/ebook). Contemporary Mathematics 637, 207-241 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Weighted tree-numbers of matroid complexes. (English. French summary) Zbl 1335.05032

Proceedings of the 27th international conference on formal power series and algebraic combinatorics, FPSAC 2015, Daejeon, South Korea, July 6–10, 2015. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 709-720 (2015).
MSC:  05B35 52B40 05C31
PDFBibTeX XMLCite

Extending real valuations to skew polynomial rings. (English) Zbl 1312.13008

Campillo, Antonio (ed.) et al., Valuation theory in interaction. Proceedings of the 2nd international conference and workshop on valuation theory, Segovia and El Escorial, Spain, July 18–29, 2011. Zürich: European Mathematical Society (EMS) (ISBN 978-3-03719-149-1/hbk). EMS Series of Congress Reports, 266-287 (2014).
PDFBibTeX XMLCite

Space saving by dynamic algebraization. (English) Zbl 1408.68073

Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. 9th international computer science symposium in Russia, CSR 2014, Moscow, Russia, June 7–11, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8476, 375-388 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the degree-chromatic polynomial of a tree. (English. French summary) Zbl 1412.05103

Proceedings of the 24th international conference on formal power series and algebraic combinatorics, FPSAC 2012, Nagoya, Japan, July 30–August 3, 2012. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Math. Theor. Comput. Sci., Proc., 69-72 (2012).
MSC:  05C31 05C15 05C05 16T30 05E15
PDFBibTeX XMLCite
Full Text: arXiv Link

A topological interpretation of the cyclotomic polynomial. (English. French summary) Zbl 1359.11084

Proceedings of the 23rd international conference on formal power series and algebraic combinatorics, FPSAC 2011, Reykjavik, Iceland, June 13–17, 2011. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 693-704 (2011).
PDFBibTeX XMLCite
Full Text: Link

On the evaluation of the Tutte polynomial at the points \((1,-1)\) and \((2,-1)\). (English. French summary) Zbl 1355.05135

Proceedings of the 23rd international conference on formal power series and algebraic combinatorics, FPSAC 2011, Reykjavik, Iceland, June 13–17, 2011. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 411-422 (2011).
MSC:  05C31 05A19
PDFBibTeX XMLCite
Full Text: Link

Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width. (English) Zbl 1333.68288

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 533-544 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Graph polynomials and their applications. I: The Tutte polynomial. (English) Zbl 1221.05002

Dehmer, Matthias (ed.), Structural analysis of complex networks. Basel: Birkhäuser (ISBN 978-0-8176-4788-9/hbk; 978-0-8176-4789-6/ebook). 219-255 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fast evaluation of interlace polynomials on graphs of bounded treewidth. (English) Zbl 1256.05110

Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 623-634 (2009).
MSC:  05C31 05C85 68W10
PDFBibTeX XMLCite
Full Text: DOI

Efficient computation of the characteristic polynomial of a tree and related tasks. (English) Zbl 1256.05232

Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 11-22 (2009).
PDFBibTeX XMLCite
Full Text: DOI

On the expressive power of CNF formulas of bounded tree- and clique-width. (English) Zbl 1198.68183

Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 252-263 (2008).
PDFBibTeX XMLCite
Full Text: DOI

The spectral problem, substitutions and iterated monodromy. (English) Zbl 1138.20025

Dawson, Donald A. (ed.) et al., Probability and mathematical physics. A volume in honor of Stanislav Molchanov. Proceedings of a conference in honor of Stanislav Molchanov’s 65th birthday, Montreal, Canada, June 27–July 1, 2005. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4089-4/pbk). CRM Proceedings and Lecture Notes 42, 225-248 (2007).
MSC:  20E08 37F10 60B15
PDFBibTeX XMLCite
Full Text: arXiv

Independence polynomials and the unimodality conjecture for very well-covered, quasi-regularizable, and perfect graphs. (English) Zbl 1119.05078

Bondy, Adrian (ed.) et al., Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004. Basel: Birkhäuser (ISBN 3-7643-7228-1/hbk). Trends in Mathematics, 243-254 (2007).
PDFBibTeX XMLCite

Generalized meta-Fibonacci sequences. (English) Zbl 1190.11008

Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18–22, 2006. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 203-214, electronic only (2006).
MSC:  11B37 11B39 05A15
PDFBibTeX XMLCite
Full Text: Link

Generalized power Menger algebras and generalized non-deterministic hypersubstitutions. (English) Zbl 1107.08005

Dorfer, G. (ed.) et al., Proceedings of the 70th workshop on general algebra “70. Arbeitstagung Allgemeine Algebra”, Vienna, Austria, May 26–29, 2005. Klagenfurt: Verlag Johannes Heyn (ISBN 3-7084-0194-8/pbk). Contributions to General Algebra 17, 61-70 (2006).
PDFBibTeX XMLCite

Nonlinear approximation by refinable functions and piecewise polynomials. (English) Zbl 1073.41002

Chui, Charles K. (ed.) et al., Approximation theory X. Abstract and classical analysis. Papers from the 10th international symposium, St. Louis, MO, USA, March 26–29, 2001. Nashville, TN: Vanderbilt University Press (ISBN 0-8265-1415-4/hbk). Innovations in Applied Mathematics, 91-112 (2002).
PDFBibTeX XMLCite

Essential inputs and minimal tree automata. (English) Zbl 1024.68069

Shtrakov, Sl. (ed.) et al., Discrete mathematics and applications. Proceedings of the 6th international conference, Bansko, Bulgaria, August 31-September 2, 2001. Blagoevgrad: South-West University. Res. Math. Comput. Sci. 77-85 (2002).
PDFBibTeX XMLCite

Polynomials of bounded tree-width. (English) Zbl 1018.65063

Cucker, Felipe (ed.) et al., Foundations of computational mathematics. Proceedings of Smalefest 2000, Hong Kong, July 13-17, 2000. Singapore: World Scientific. 211-250 (2002).
MSC:  65H05 12Y05 05C65 05C85 12E20 06F25
PDFBibTeX XMLCite

Some new families of integral trees with diameters 4 and 6. (English) Zbl 1412.05062

Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 119-123 (2001).
MSC:  05C12 05C75 05C31
PDFBibTeX XMLCite
Full Text: Link

Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width. (English) Zbl 0988.05087

Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 487-495 (2001).
MSC:  05C85 05C15 05C05
PDFBibTeX XMLCite

A generalization of the \(q\)-Saalschütz sum and the Burge transform. (English) Zbl 0982.33009

Kashiwara, Masaki (ed.) et al., Physical combinatorics. Proceedings of a workshop, Kyoto, Japan, January 29 - February 2, 1999. Boston: Birkhäuser. Prog. Math. 191, 163-183 (2000).
PDFBibTeX XMLCite
Full Text: arXiv

The Fibonacci shuffle tree. (English) Zbl 0919.11014

Bergum, G. E. (ed.) et al., Applications of Fibonacci numbers. Volume 7: Proceedings of the 7th international research conference on Fibonacci numbers and their applications, Graz, Austria, July 15–19, 1996. Dordrecht: Kluwer Academic Publishers. 9-16 (1998).
MSC:  11B39 05C05
PDFBibTeX XMLCite

On dichotomous complexity of the Fibonacci tree. (English) Zbl 0853.05029

Bergum, G. E. (ed.) et al., Applications of Fibonacci numbers. Volume 6: Proceedings of the sixth international research conference on Fibonacci numbers and their applications, Washington State University, Pullman, WA, USA, July 18-22, 1994. Dordrecht: Kluwer Academic Publishers. 251-256 (1996).
MSC:  05C05 11B39
PDFBibTeX XMLCite

Totient functions on the Euler number tree. (English) Zbl 0799.05014

Bergum, G. E. (ed.) et al., Applications of Fibonacci numbers. Volume 5: Proceedings of the fifth international conference on Fibonacci numbers and their applications, University of St. Andrews, Scotland, July 20-24, 1992. Dordrecht: Kluwer Academic Publishers. 585-600 (1993).
MSC:  05C05 11B39
PDFBibTeX XMLCite

Balance morphology of a binary tree. (English) Zbl 0789.05027

Bergum, G. E. (ed.) et al., Applications of Fibonacci numbers. Volume 5: Proceedings of the fifth international conference on Fibonacci numbers and their applications, University of St. Andrews, Scotland, July 20-24, 1992. Dordrecht: Kluwer Academic Publishers. 345-354 (1993).
MSC:  05C05 11B39
PDFBibTeX XMLCite

Filter Results by …

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software