Searcharxiv⌕ Search

arXiv subjects

Yunied Puig

Publications and source records attributed to Yunied Puig.

11 recordsLinked to original sources

Exact Output Steering with Vanishing Controls in Weighted Shift Dynamics

Exploiting the rich dynamics of wrapped weighted shifts and their residualizations, we characterize exact projected steering with vanishing initial controls. For wrapped shifts, steering is characterized by an expansive cycle multiplier and a residue separating the source and control channels. For residual shifts, a distinct spectral--toral mechanism emerges: steering through selected conjugate planes is equivalent to radial expansion and an arithmetic parity condition on phase resonances, yielding bounded-gap steering times and quantitative control estimates. For structured machine-learning representations built from orbit dictionaries, we derive a two-scale gain condition for steering coefficients while preserving decoded outputs.

math.OC↗

A Constructive Orbit-Based Theory of Learnability

We develop a finite-dimensional orbit framework for constructing data-adapted dictionaries, sparse realizations, and predictive extensions. The method uses wrapped weighted shifts to generate orbit dictionaries and local interpolation maps from independent orbit representatives, turning the learning problem into three explicit tasks: scaffold discovery, sparse realization on the discovered dictionary, and prediction through learned sparse coordinates. We introduce CCDS as the main constructive ingredient: a deviation-controlled sparse realization procedure that recovers MP/OMP-type behavior at the minimal-deviation boundary while allowing feasible interior paths with prescribed residual geometry that is inaccessible to MP/OMP. We prove generic orbit independence, exact block interpolation with norm control, observable bounds on sparse approximation distortion, sparse realization guarantees on selected supports, and fixed-path stability under admissible perturbations of the block interpolants. These results connect sparse approximation, interpolation, and finite-dimensional operator dynamics through the construction and analysis of data-induced orbit dictionaries. Experiments on synthetic geometry, controlled realization tests, and standard classification benchmarks show that selected orbit scaffolds have substantially better matched-rank projection behavior than random orbit or unstructured alternatives, that CCDS attains near-zero realization error at the minimal-deviation boundary, and that predictors trained from the sparse CCDS certificates give competitive performance.

cs.LG↗

OrBIT: Structure-Guided Embedding Compression

Embedding tables are among the largest components of modern language models. Most compression methods fix a coding geometry such as coordinate blocks, low-rank subspaces, or unrestricted codebooks, and optimize within it. We instead ask whether the coding geometry can itself be discovered. We introduce \emph{OrBIT}, a structure-guided embedding compression framework that learns reusable local geometry from orbit dynamics and uses it to constrain a small set of shared codewords. The global reconstruction residual then decides where the fixed coding budget is spent, while redundant overlapping charts let local errors compensate one another after gluing. Our theory shows how tight-chart geometry controls distortion, how the global residual directs sequential allocation, and how data-geometry-guided refinement improves the codec. The resulting orbit machinery is compiled away, leaving a compact decoder in which the learned structure governs what is stored, where capacity is allocated, and how local information is assembled globally. Across four LLM embedding tables, OrBIT achieves $37.9\times$ compression on GPT-2 and over $23\times$ on each 7B table relative to 16-bit storage, while delivering competitive rate-distortion performance against established quantization and low-rank baselines.

cs.LG↗

Symmetric tensor powers of graphs

The symmetric tensor power of graphs is introduced and its fundamental properties are explored. A wide range of intriguing phenomena occur when one considers symmetric tensor powers of familiar graphs. A host of open questions are presented, hoping to spur future research.

math.CO↗

Disjoint frequently hypercyclic pseudo-shifts

We obtain a Disjoint Frequent Hypercyclicity Criterion and show that it characterizes disjoint frequent hypercyclicity for a family of unilateral pseudo-shifts on $c_0(\mathbb{N})$ and $\ell^p(\mathbb{N})$, $1\le p <\infty$. As an application, we characterize disjoint frequently hypercyclic weighted shifts. We give analogous results for the weaker notions of disjoint upper frequent and reiterative hypercyclicity. Finally, we provide counterexamples showing that, although the frequent hypercyclicity, upper frequent hypercyclicity, and reiterative hypercyclicity coincide for weighted shifts on $\ell^p(\mathbb{N})$, this equivalence fails for disjoint versions of these notions.

math.FA↗

Existence of disjoint frequently hypercyclic operators which fail to be disjoint weakly mixing

In this short note, we answer a question of Martin and Sanders [Integr. Equ. Oper. Theory, 85 (2) (2016), 191-220] by showing the existence of disjoint frequently hypercyclic operators which fail to be disjoint weakly mixing and, therefore, fail to satisfy the Disjoint Hypercyclicity Criterion. We also show that given an operator $T$ such that $T \oplus T$ is frequently hypercyclic, the set of operators $S$ such that $T, S$ are disjoint frequently hypercyclic but fail to satisfy the Disjoint Hypercyclicity Criterion is SOT dense in the algebra of bounded linear operators.

math.FA↗

Frequent hypercyclicity and piecewise syndetic recurrence sets

Motivated by a question posed by Sophie Grivaux concerning the regularity of the orbits of frequently hypercylic operators, we show the following: for any operator $T$ on a separable metrizable and complete topological vector space $X$ which is both frequently hypercyclic and piecewise syndetic hypercyclic, the lower density and upper Banach density of the recurrence set $\{n\geq 1: T^n x\in U\}$ are different, for any hypercyclic vector $x\in X$ for $T$, and a certain collection of non-empty open sets $U\subseteq X$. As an immediate consequence we got a sufficient condition for a chaotic operator to be non frequently hypercyclic.

math.FA↗

Linear dynamics and recurrence properties defined via essential idempotents of $β\mathbb{N}$

Consider $\mathscr{F}$ a non-empty set of subsets of $\mathbb{N}$. An operator $T$ on $X$ satisfies property $\mathcal{P}_{\mathscr{F}}$ if for any $U$ non-empty open set in $X$, there exists $x\in X$ such that $\{n\in\mathbb{N}: T^nx\in U\}\in \mathscr{F}$. Let $\overline{\mathcal{BD}}$ the collection of sets in $\mathbb{N}$ with positive upper Banach density. Our main result is a characterization of sequence of operators satisfying property $\mathcal{P}_{\overline{\mathcal{BD}}}$, for which we have used a strong result of Bergelson and Mccutcheon in the vein of Szemerédi's theorem. It turns out that operators having property $\mathcal{P}_{\overline{\mathcal{BD}}}$ satisfy a kind of recurrence described in terms of essential idempotents of $β\mathbb{N}$. We will also discuss the case of weighted backward shifts. Finally, we obtain a characterization of reiteratively hypercyclic operators.

math.FA↗

Disjoint Hypercyclicity along filters

We extend a result of Bès, Martin, Peris and Shkarin by stating: $B_w$ is $\mathscr{F}$-weighted backward shift if and only if $(B_w,\dots, B_w^r)$ is $d$-$\mathscr{F}$, for any $r\in \mathbb{N}$, where $\mathscr{F}$ runs along some filters containing strictly the family of cofinite sets, which are frequently used in Ramsey theory. On the other hand, we point out that this phenomenon does not occur beyond the weighted shift frame by showing a mixing linear operator $T$ on a Hilbert space such that the tuple $(T, T^2)$ is not $d$-syndetic. We also investigate the relationship between reiteratively hypercyclic operators and $d$-$\mathscr{F}$ tuples, for filters $\mathscr{F}$ contained in the family of syndetic sets. Finally, we examine conditions to impose in order to get reiterative hypercyclicity from syndeticity in the weighted shift frame.

math.FA↗