---
title: MARCOS in Mathematics, MRI, and AI
url: https://www.emergentmind.com/topics/marcos
type: topic
---

# MARCOS in Mathematics, MRI, and AI

MARCOS is a label that appears in contemporary research in several distinct senses. In the material represented here, it denotes, first, the surname of researchers—especially E. N. Marcos and J. M. Marcos—whose work is embedded in representation theory, homological algebra, non-classical logic, and statistical physics; second, the open-source MRI console **MaRCoS**, expanded as **MAgnetic Resonance COntrol System**; and third, the large-language-model reasoning framework **MARCOS**, expanded as **Markov Chain of Continuous Thoughts**. These usages are unrelated in subject matter but each has acquired technical meaning in its own literature [2109.03704] [2208.01616] [2509.25020] [2411.07923].

## 1. E. N. Marcos in representation theory of finite-dimensional algebras

A central Marcos-associated line of work concerns the relationship between diagonalizable derivations, maximal tori in Hochschild cohomology, and fundamental groups of presentations of finite-dimensional algebras. In "Maximal tori in \(HH^1\) and the fundamental group" [2109.03704], Marcos appears as one of the main predecessors through earlier work with Farkas and Green on diagonalizable derivations of finite-dimensional algebras and their realization via additive characters on \(\pi_1(Q,I)\). The paper states that its main theorem extends work of Farkas–Green–Marcos, of de la Peña–Saorín, and of Le Meur, and removes earlier restrictions by working for arbitrary finite-dimensional algebras over an algebraically closed field.

The main conceptual step is the identification of maximal tori in \(HH^1(A)\) with duals of fundamental groups of presentations. The paper defines diagonalizable subalgebras of \(HH^1(A)\) and proves that maximal diagonalizable subalgebras are exactly maximal tori. Its fundamental theorem states that every maximal torus of \(HH^1(A)\) is of the form \(\operatorname{im}(\theta_\nu)\) for some presentation \(\nu:kQ\to A\), equivalently that every maximal diagonalizable subalgebra of \(HH^1(A)\) is isomorphic to
\[
\operatorname{Hom}(\pi_1(Q,I),k^+)
\]
for some presentation \(A\cong kQ/I\) [2109.03704].

This leads to the equality
\[
\operatorname{mt\mbox{-}rank}(HH^1(A))=\pi_1\text{-rank}(A),
\]
where \(\pi_1\text{-rank}(A)\) is defined by maximizing \(\dim_k\operatorname{Hom}(\pi_1(Q,I),k^+)\) over minimal presentations, and \(\operatorname{mt\mbox{-}rank}(HH^1(A))\) is the maximal dimension of a torus in \(HH^1(A)\). The paper then deduces that \(\pi_1\)-rank\((A)\) is a derived invariant, and that among self-injective algebras it is also invariant under stable equivalence of Morita type [2109.03704].

The same paper places Marcos in a second historical line through the Bardzell–Marcos theorem on monomial algebras. Bardzell and Marcos had proved that if \(A=kQ/I\) is a finite-dimensional monomial algebra and \(HH^1(A)=0\), then \(Q\) is a tree. The new result strengthens this to
\[
\operatorname{mt\mbox{-}rank}(HH^1(A))=0 \iff Q \text{ is a tree},
\]
and extends it from monomial to semimonomial algebras. It also proves that if two finite-dimensional monomial algebras are derived equivalent, then their Gabriel quivers contain the same number of arrows, and consequently there are only finitely many monomial algebras in any given derived equivalence class [2109.03704].

## 2. Cibils–Marcos orbit categories and categorical Clifford theory

A second major Marcos-associated theme is the orbit category introduced by Cibils and Marcos. In "Clifford's theorem for orbit categories" [2206.09394], Zimmermann studies an \(R\)-linear Krull–Schmidt category \(\mathcal H\) with a finite group \(\Gamma\) acting by automorphisms and treats the orbit category
\[
\mathcal C[\Gamma](X,Y)=\bigoplus_{g\in \Gamma}\mathcal C(X,gY)
\]
as the categorical setting for a Clifford-theoretic decomposition theory. The paper explicitly says that it “provides the orbit category introduced by Cibils and Marcos,” later studied by Keller in cluster theory and by Asashiba in covering theory [2206.09394].

Its decisive reinterpretation is monadic. If
\[
A=\bigoplus_{g\in\Gamma} g,
\]
then the orbit category is naturally isomorphic to the Kleisli category \(\mathcal R_A\), with
\[
\mathcal R_A(X,Y)\cong \mathcal H(X,AY).
\]
This identifies the Cibils–Marcos orbit category as the Kleisli category of the monad naturally attached to the group action [2206.09394].

The paper then formulates a categorical Clifford theorem. For an indecomposable \(M\in\mathcal H\), it defines the inertia subgroup
\[
\Gamma_M=\{g\in\Gamma\mid gM\cong M\},
\]
constructs adjoint pairs between \(\mathcal H[\Gamma_M]\) and \(\mathcal H[\Gamma]\), and proves that if \(M_0\) is an indecomposable direct factor of the image of \(M\) in the inertia-level orbit category, then its image in the full orbit category is indecomposable. In this way, the Cibils–Marcos construction becomes the categorical analogue of induction from a normal subgroup to the ambient group [2206.09394].

This places Marcos in a precise categorical lineage: the orbit category is not treated merely as notation, but as the correct receptacle for induction/restriction, inertia subgroups, Karoubi completion, and decomposition of indecomposables.

## 3. Homological algebra: \(\tau\)-Hochschild theory, \(\delta\)-Koszulity, and homotopy liftings

Marcos also appears centrally in several homological programs. In " \(τ\)-Hochschild (co)homology, the square of the Serre bimodule, and the Coxeter automorphism of the Tamarkin--Tsygan calculus" [2607.10913], Armenta builds on the \(\tau\)-Hochschild theory introduced by Cibils, Lanzilotta, Marcos and Solotar. The defining higher translates are
\[
\tau_n=\tau\Omega^{n-1},
\]
and the paper proves that, for a minimal \(\Lambda^{\mathrm e}\)-projective resolution \(P_\bullet\to\Lambda\), the Nakayama transform \(\nu(P_\bullet)\) represents \(D\Lambda\otimes_\Lambda^{\mathbf L}D\Lambda\), while
\[
\tau_n\Lambda=\mathrm Z_n(\nu P_\bullet)=\ker \nu(d_n).
\]
This yields the short exact sequence
\[
0\longrightarrow \mathrm B_n\longrightarrow \tau_n\longrightarrow \Tor_n^\Lambda(D\Lambda,D\Lambda)\longrightarrow 0,
\]
thereby separating a derived shadow from a strictly Morita-theoretic residue [2607.10913].

The same paper states that, in top degree \(d=\gldim\Lambda\),
\[
\tau_d\cong D\bigl(\Pi_{d+1}(\Lambda)_1\bigr),
\]
and for hereditary \(\Lambda=kQ\),
\[
\tau_1\Lambda\cong D\Pi(Q)_1,\qquad \HH^1_\tau(kQ)\cong \HH_0(\Pi(Q))_1.
\]
For self-injective algebras, the derived part vanishes identically, so
\[
\tau_n=\mathrm B_n=\operatorname{im}\nu(d_{n+1}) \qquad(n\ge 1).
\]
Armenta also notes that taking Euler characteristics in the Cibils–Lanzilotta–Marcos–Solotar dimension formulas recovers Happel’s trace formula [2607.10913].

In a different homological direction, Lü’s "Quasi-Koszulity and minimal Horseshoe Lemma" [1109.3771] is explicitly presented as a nongraded extension of the \(\delta\)-Koszul program initiated by Green and Marcos. The paper defines a quasi-\(\delta\)-Koszul module by radical conditions on a minimal projective resolution:
\[
\ker d_n \subseteq J^{\delta(n+1)-\delta(n)}P_n,\qquad
J\ker d_n = \ker d_n \cap J^{\delta(n+1)-\delta(n)+1}P_n,
\]
and proves that for a short exact sequence
\[
0\to K\to M\to N\to 0
\]
in the category of quasi-\(\delta\)-Koszul modules, the minimal Horseshoe Lemma holds if and only if
\[
JK=K\cap JM.
\]
This is the radical-theoretic criterion extracted from the Green–Marcos degree-pattern idea [1109.3771].

Marcos also appears as a foundational source in Oke’s "Bracket structure on Hochschild cohomology of Koszul quiver algebras using homotopy liftings" [2103.12331]. There, E. L. Green, G. Hartman, E. N. Marcos and Ø. Solberg are cited for providing a canonical minimal projective bimodule resolution of a Koszul quiver algebra. Oke uses the comultiplicative structure of that resolution to define homotopy lifting maps and compute Gerstenhaber brackets directly on the minimal resolution, including degree-\(1\) and degree-\(2\) cocycles and applications to Hochschild \(2\)-cocycles satisfying the Maurer–Cartan equation [2103.12331].

Taken together, these papers show Marcos-associated work spanning higher Auslander–Reiten translates, Morita invariance questions, radical criteria for minimality, and explicit minimal-resolution techniques for Gerstenhaber structures.

## 4. Marcos and the logic \(P^2\)

In non-classical logic, Marcos is associated with the identification and naming of \(P^2\), a Sette-like paraconsistent logic. "Mortensen Logics" [2204.06731] states that Mortensen proposed a logic \(C_{0.2}\), and that Marcos later modified it to obtain a variant of Sette’s logic, identified and called \(P^2\) by Marcos. The paper specifies the modification: replace the interpretation \(\{\ \}\) by the interpretation \(\{1,0\}\), make the value \(2\) designated along with \(1\), and put \(\sim\) instead of \(\neg\), thereby obtaining \(P^2\) [2204.06731].

The same paper studies the connexive enrichment \(cP^2\), obtained by replacing the \(P\)-conditional with Mortensen’s \(E\)-conditional. It remarks that M3V and \(cP^2\) coincide in the \(\{\sim,\rightarrow_E\}\)-fragment, but differ because \(cP^2\) retains the Sette-like \(\wedge_P\) and \(\vee_P\) [2204.06731].

This difference matters for inconsistency and connexivity. The paper’s headline comparison is that the inconsistency of M3V is attenuated in the connexive variant of the Sette-like \(P^2\), whereas it is exacerbated in the connexive variant of closed set logic. Concretely, the paper states that Aristotle’s Second Thesis and Abelard’s Principle,
\[
\sim ((A \rightarrow_E B)\wedge_P(\sim A\rightarrow_E B)),
\qquad
\sim ((A \rightarrow_E B)\wedge_P(A\rightarrow_E \sim B)),
\]
are valid in M3V but not in \(cP^2\) [2204.06731].

The paper also uses \(P^2\) in a broader claim about conditional semantics. Mortensen’s \(E\)-conditional is said to be “connexively stable,” meaning that it remains connexive when combined with the main paraconsistent negations \(\sim\) and \(\neg\). In that comparison, the Marcos-associated \(P^2/cP^2\) family supplies the \(\sim\)-based side of the argument [2204.06731].

## 5. MaRCoS and MaRGA in low-field MRI

Outside mathematics and logic, the most prominent acronymic use is **MaRCoS**, the **MAgnetic Resonance COntrol System**. "MaRCoS, an open-source electronic control system for low-field MRI" [2208.01616] describes it as an open-source MRI console that combines hardware, firmware, and software for the integral control of MRI scanners. Its hardware foundation is the Red Pitaya SDRLab 122-16, based on a Xilinx Zynq-7020 system-on-chip with two embedded ARM processors, dual-channel 16-bit ADC, dual-channel 14-bit DAC, a 122.88 MHz crystal oscillator, two analog inputs for RX, two analog outputs for TX, and digital I/O. The paper states that MaRCoS can handle **cycle-accurate sequences without hard length limitations**, **rapid bursts of events**, and **arbitrary waveforms**, and that it does not use raster clocks or impose timing constraints beyond the hardware clock [2208.01616].

Its architecture is a streamed PC–server–FPGA design. The user works from a PC; `marcos_client` compiles sequence descriptions into binary instructions and sends them over Ethernet to the embedded MaRCoS server on the SDRLab; the server streams instructions into FPGA buffers and drains receive buffers; and the FPGA executes a generic timed-event language through an instruction decoder and sequencer connected to 24 output/timing FIFOs. The system supports arbitrary waveforms for RF envelope amplitude and phase, gradients, digital outputs, NCO frequencies, and receiver decimation settings [2208.01616].

"Benchmarking the performance of a low-cost Magnetic Resonance Control System at multiple sites in the open MaRCoS community" [2203.11314] demonstrates the same console across three institutions and three scanners: a 360 mT tabletop educational/research MRI at MGH, a 50 mT human Halbach scanner at LUMC, and a 70–72 mT portable human Halbach scanner at i3M. The paper emphasizes native GUI programming, direct low-level sequence specification, and a PulSeq overlay, and shows implementations of SE, RARE, GRE, STIR, and radial non-Cartesian 3D SE. Its stated conclusion is that common sequences used in the clinic can be programmed into an open-source system relatively quickly and easily, and can produce good quality images even at this early stage of development [2203.11314].

"MaRGA: a Graphical and Application Interface for MaRCoS" [2312.08711] presents the user-facing layer built on top of MaRCoS. MaRGA is fully coded in Python 3, designed for intuitive scanner control, compatible with clinical environments, and based on an uncomplicated set of GUI panels and a renewed API. The API centers on the parent class `mriBlankSeq`, which provides sequence creation, execution, and data management; pulse-sequence classes run through `sequenceRun`, reconstruction and analysis through `sequenceAnalysis`, waveform validation and transfer through `floDict2Exp`, and export through `saveRawData` into DICOM 3.0 and `.mat` files [2312.08711].

The GUI is organized around a **Session window**, **Main window**, and **Post-processing window**. New functionality includes session-aware metadata handling, multi-sequence protocols, comparison of reconstructions from the same session, image post-processing, and one-click automatic calibration of Larmor working frequency, RF coil efficiency, and gradient shim currents. The post-processing window supports \(k\)-space and image-space operations, including zero-padding, cosine-bell filters, BM4D denoising, Gaussian filtering, FFT, Partial Fourier by zero padding, POCS, and ART, with iterative methods programmed to be compatible with GPU execution. The paper reports operation on an experimental 0.2 T scanner designed for hard-tissue imaging and on a 72 mT portable scanner installed in the radiology department of a large hospital [2312.08711].

A plausible implication is that MaRCoS and MaRGA together define not only an open console architecture, but an open workflow stack spanning sequence design, execution, calibration, reconstruction, metadata management, and clinical-format export.

## 6. MARCOS as latent reasoning in large language models

A second acronymic use is **MARCOS**, expanded in "MARCOS: Deep Thinking by Markov Chain of Continuous Thoughts" [2509.25020] as **Markov Chain of Continuous Thoughts**. The paper begins from the chain-of-thought paradigm and argues that token-level reasoning is slow, creates a discrete bottleneck between steps, and entangles reasoning with token generation. MARCOS replaces token-level reasoning traces with a latent sequence of continuous thoughts, modeled as a conditional hidden Markov model in which explicit reasoning steps are observable variables and internal thoughts are hidden variables [2509.25020].

The input question \(x\) is encoded by an “understander,”
\[
\mathrm H^{in}=\mathrm{Understander}(x),
\]
and each latent reasoning step maintains two continuous neural states, \(\mathbf{Neu}^{deep}_k\) and \(\mathbf{Neu}^{shallow}_k\). A learnable predictor \(g\) parameterizes a Gaussian prior over a step-level random variable \(\mathbf R_k\),
\[
\mathbf{\mu}_k,\mathbf{\sigma}_k=g(\mathbf{Neu}_{k-1}^{deep},\mathbf{Neu}_{k-1}^{shallow},\mathrm H^{in}),\qquad
\mathbf R_k\sim\mathcal N(\mathbf\mu_k,\mathbf\sigma_k),
\]
after which the “thinker” updates the latent thought state and the “speaker” can decode an explicit sentence from the shallow state [2509.25020].

Because this latent process is incompatible with standard supervised learning, the paper proposes a two-phase variational training scheme. A randomness encoder \(f\) infers posterior Gaussian parameters from the observed reasoning step \(y_k\), and training optimizes a reconstruction term, a KL term between the learned prior and posterior Gaussians, and a sparsity penalty
\[
\mathcal L_k^{sparse}=\|\mathbf R_k\|_1.
\]
The full objective is
\[
\mathcal{L}= \sum_{k\in \{1,2,\dots,N\}} \big[- \mathcal{L}_k^{re} + \mathcal{L}_k^{KL} + \lambda \mathcal{L}^{sparse}_k\big].
\]
The paper states that the sparsity term is essential: removing it causes near-total model collapse, with accuracies dropping to around \(1\%\) [2509.25020].

Empirically, MARCOS is evaluated on GSM8K, SVAMP, and MultiArith. The headline claim is that it outperforms existing continuous reasoning methods and, for the first time, achieves performance comparable to token-based CoT, even surpassing it by \(4.7\%\) on GSM8K with up to \(15.7\times\) speedup in inference. On text supervision it reaches \(17.97\%\) GSM8K accuracy versus \(13.27\%\) for text CoT-SFT (0.5B), and on equation supervision it reaches \(24.11\%\) GSM8K accuracy. The paper also argues that MARCOS offers step-level instead of token-level control over randomness, opening opportunities for reinforcement learning and controlled reasoning [2509.25020].

The framework’s limitations are also explicit: experiments are restricted to GSM8K, SVAMP, and MultiArith; models are trained from scratch; absolute accuracies remain low compared with frontier systems; and the number of reasoning steps is fixed to \(K=3\) in the reported experiments [2509.25020].

## 7. J. M. Marcos and microscopic roughening of wetting fronts

The surname Marcos also appears in statistical physics through J. M. Marcos. "Microscopic fluctuations in the spreading fronts of circular wetting liquid droplets" [2411.07923] studies the precursor fronts of nonvolatile liquid droplets spreading on solid substrates, now in circular geometry rather than the band geometry treated by an earlier paper by J. M. Marcos et al. The model is a lattice gas with Hamiltonian
\[
\mathcal H=
-J\sum_{\langle \mathbf r,\mathbf s\rangle}n(\mathbf r,t)n(\mathbf s,t)
-A\sum_{\mathbf r}\frac{n(\mathbf r,t)}{Z^3},
\]
with a circular reservoir, two retained fluid layers, and kinetic Monte Carlo Kawasaki dynamics [2411.07923].

The principal spreading observable is the average front position,
\[
R(t)\sim t^\delta,
\]
implemented numerically as \(\langle\overline{h_R}(t)\rangle\sim t^\delta\). For circular droplets the paper finds \(\delta\lesssim 1/2\), with a stronger dependence on temperature and substrate wettability than in band geometry. The roughness is measured through
\[
w^2(t)\sim t^{2\beta},
\]
and through the height-difference correlation function
\[
C_2(s,t)=\frac1N\sum_{\bar h\Delta\theta_{ij}\in s}\langle[h_i(t)-h_j(t)]^2\rangle.
\]
The paper concludes that circular droplets display intrinsic anomalous scaling, with different roughness exponents at short and large length scales [2411.07923].

A further result is distributional. The fluctuation statistics are reported to be close to the Tracy–Widom probability distribution function that applies in the corresponding KPZ universality subclass, now the one expected for interfaces with an overall circular symmetry. This distinguishes the circular-droplet case from the earlier band geometry, where the relevant Tracy–Widom subclass was GOE rather than GUE. The authors present this as a geometry test of the same microscopic wetting model [2411.07923].

In this usage, “Marcos” refers not to an acronym but to authorship within a research line on precursor-front roughening, diffusive or subdiffusive advance, intrinsic anomalous scaling, and geometry-dependent fluctuation subclasses.

Source: https://www.emergentmind.com/topics/marcos