We study the expressive power of , a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where (non)expressiveness results translate to class separations. A typical example of a polynomial recursive sequence is = !. Our main result is that the sequence = is not polynomial recursive.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11343969 | PMC |
| http://dx.doi.org/10.1007/s00224-021-10046-9 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Identifying Markov Chain Models from Time-to-Event Data: An Algebraic Approach.
Bull Math Biol
December 2024
IGH, CNRS, University of Montpellier, 141 Rue de la Cardonille, 34094, Montpellier, France.
Many biological and medical questions can be modeled using time-to-event data in finite-state Markov chains, with the phase-type distribution describing intervals between events. We solve the inverse problem: given a phase-type distribution, can we identify the transition rate parameters of the underlying Markov chain? For a specific class of solvable Markov models, we show this problem has a unique solution up to finite symmetry transformations, and we outline a recursive method for computing symbolic solutions for these models across any number of states. Using the Thomas decomposition technique from computer algebra, we further provide symbolic solutions for any model.
View Article and Find Full Text PDFMachine Learning Differentiates Between Benign and Malignant Parotid Tumors With Contrast-Enhanced Ultrasound Features.
J Oral Maxillofac Surg
October 2024
Associate Chief Physician, Department of Oral and Maxillofacial Surgery, The Third Affiliated Hospital of Soochow University, Changzhou, China. Electronic address:
Article Synopsis
- The study explores the use of machine learning, specifically support vector machine (SVM) algorithms, to differentiate between benign and malignant parotid tumors based on contrast-enhanced ultrasound (CEUS) data.
- A retrospective analysis included 48 patients who underwent parotidectomy, focusing on various clinical and laboratory variables to train and test the SVM model.
- Results indicated that the SVM model successfully identified key CEUS and laboratory variables, achieving notable diagnostic performance, underscoring the potential for machine learning in preoperative tumor diagnosis.
Single vibronic level fluorescence spectra from Hagedorn wavepacket dynamics.
J Chem Phys
September 2024
Laboratory of Theoretical Physical Chemistry, Institut des Sciences et Ingénierie Chimiques, Ecole Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland.
In single vibronic level (SVL) fluorescence experiments, the electronically excited initial state is also excited in one or several vibrational modes. Because computing such spectra by evaluating all contributing Franck-Condon factors becomes impractical (and unnecessary) in large systems, here we propose a time-dependent approach based on Hagedorn wavepacket dynamics. We use Hagedorn functions-products of a Gaussian and carefully generated polynomials-to represent SVL initial states because in systems whose potential is at most quadratic, Hagedorn functions are exact solutions to the time-dependent Schrödinger equation and can be propagated with the same equations of motion as a simple Gaussian wavepacket.
View Article and Find Full Text PDFFast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing.
IEEE Trans Vis Comput Graph
September 2024
Scalar field comparison is a fundamental task in scientific visualization. In topological data analysis, we compare topological descriptors of scalar fields-such as persistence diagrams and merge trees-because they provide succinct and robust abstract representations. Several similarity measures for topological descriptors seem to be both asymptotically and practically efficient with polynomial time algorithms, but they do not scale well when handling large-scale, time-varying scientific data and ensembles.
View Article and Find Full Text PDFOn Polynomial Recursive Sequences.
Theory Comput Syst
June 2021
Université de Bordeaux, Bordeaux, France.
We study the expressive power of , a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where (non)expressiveness results translate to class separations. A typical example of a polynomial recursive sequence is = !.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!