Mihai Prunescu

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Symmetric Functions over Finite Fields2023-09-24Paper
Symmetries in the Pascal triangle: \(p\)-adic valuation, sign-reduction modulo \(p\) and the last non-zero digit2023-06-02Paper
Smooth approximations by continuous choice-functions
Soft Computing
2022-11-22Paper
Two results about the rational numbers2022-05-09Paper
On representations of intended structures in foundational theories
Journal of Philosophical Logic
2022-04-04Paper
THE EXPONENTIAL DIOPHANTINE PROBLEM FOR
Journal of Symbolic Logic
2021-01-29Paper
A growth model based on the arithmetic \(Z\)-game
Chaos, Solitons and Fractals
2017-10-18Paper
About a surprising computer program of Matthias Müller
Convexity and Discrete Geometry Including Graph Theory
2017-09-06Paper
Linear recurrent double sequences with constant border in \(M_2(\mathbb F_2)\) are classified according to their geometric content
Symmetry
2017-05-12Paper
A two-valued recurrent double sequence that is not automatic
Theoretical Computer Science
2014-03-13Paper
\(\mathbb F_p\)-affine recurrent \(n\)-dimensional sequences over \(\mathbb F_q\) are \(p\)-automatic
European Journal of Combinatorics
2012-12-03Paper
Recurrent two-dimensional sequences generated by homomorphisms of finite abelian \(p\)-groups with periodic initial conditions
Fractals
2012-04-20Paper
The Thue-Morse-Pascal double sequence and similar structures
Comptes Rendus. Mathématique. Académie des Sciences, Paris
2011-10-21Paper
RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
Fractals
2010-06-30Paper
Self-similar carpets over finite fields
European Journal of Combinatorics
2009-06-17Paper
Concrete algebraic cohomology for the group \((\mathbb R,+)\) or how to solve the functional equation \(f(x+y)-f(x)-f(y)=g(x,y)\)2008-12-11Paper
An undecidable property of recurrent double sequences
Notre Dame Journal of Formal Logic
2008-06-18Paper
Dynamical systems with double recursion are undecidable2007-10-10Paper
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science
2007-04-30Paper
Structure with fast elimination of quantifiers
Journal of Symbolic Logic
2006-07-05Paper
Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions
MLQ
2006-03-24Paper
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity
2005-09-02Paper
Diophantine properties of finite commutative rings
Archive for Mathematical Logic
2003-09-16Paper
A model-theoretic proof for P ≠ NP over all infinite abelian group
Journal of Symbolic Logic
2003-07-05Paper
PNP for all infinite Boolean algebras
Mathematical Logic Quarterly
2003-04-10Paper
An isomorphism between monoids of external embeddings: About definability in arithmetic
Journal of Symbolic Logic
2002-12-04Paper
Non-effective quantifier elimination
Mathematical Logic Quarterly (MLQ)
2002-09-16Paper
\(\text{P}\neq \text{NP}\) for the reals with various analytic functions
Journal of Complexity
2001-07-23Paper
Most homeomorphisms of the circle are semiperiodic
Archiv der Mathematik
1995-07-03Paper
On the representation of C-recursive integer sequences by arithmetic terms
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Mihai Prunescu