2000 character limit reached
Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata (2404.14245v1)
Published 22 Apr 2024 in cs.CC and cs.FL
Abstract: We determine all functional closure properties of finite $\mathbb{N}$-weighted automata, even all multivariate ones, and in particular all multivariate polynomials. We also determine all univariate closure properties in the promise setting, and all multivariate closure properties under certain assumptions on the promise, in particular we determine all multivariate closure properties where the output vector lies on a monotone algebraic graph variety.
- An inequality for the weights of two families of sets, their unions and intersections. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 43:183–185, 1978.
- The probabilistic method. John Wiley & Sons, 2016.
- Computing the continuous discretely, volume 61. Springer, 2007.
- Inequalities. Springer, Berlin, 1961.
- Richard Beigel. Closure properties of GapP and #P. In Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pages 144–146. IEEE, 1997.
- Computational complexity of counting coincidences. 2023.
- Equality cases of the Alexandrov–Fenchel inequality are not in the polynomial hierarchy. 2023.
- Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer Science & Business Media, 2013.
- Handbook of weighted automata. Springer Science & Business Media, 2009.
- Weighted automata. pages 113–150. in Handbook of Automata Theory, European Mathematical Society.
- Polynomial interpolation in several variables. Advances in Computational Mathematics, 12:377–410, 2000.
- Inequalities. Cambridge University Press, 1952.
- On the power of number-theoretic operations with respect to counting. In Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, pages 299–314. IEEE, 1995.
- What is in #P and what is not? In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 860–871. IEEE, 2022.
- Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3573–3586. SIAM, 2023.
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theoretical Computer Science, 327(3):349–373, 2004.
- Igor Pak. Complexity problems in enumerative combinatorics. In Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018, pages 3153–3180. World Scientific, 2018.
- Igor Pak. Combinatorial inequalities. Notices of the AMS, 66(7), August 2019.
- Igor Pak. What is a combinatorial interpretation? to appear: Proc. Open Problems in Algebraic Combinatorics. https://www.samuelfhopkins.com/OPAC/files/proceedings/pak.pdf, 2022.
- J Peterson. Beviser for wilsons og fermats theoremer. Tidsskrift for mathematik, 2:64–65, 1872.
- Marcel Paul Schützenberger. On the definition of a family of automata. Inf. Control., 4(2-3):245–270, 1961.
- Igor R Shafarevich. Basic algebraic geometry 1: Varieties in projective space. Springer Science & Business Media, 3 edition, 2013.
- Michael Spivey. The Chu-Vandermonde identity via Leibniz’s identity for derivatives. The College Mathematics Journal, 47(3):219–220, 2016.
- Richard P Stanley. Positivity problems and conjectures in algebraic combinatorics. Mathematics: frontiers and perspectives, 295:319, 1999.