Carlos
Miguel
Soto

About Me

I'm a software developer and a computer science and mathematics student at the University of Buenos Aires. I have participated in various math and programming Olympiads, and now I'm giving back to the community by coaching the Argentina IOI team.

Resume (pdf)

Research

My primary interest lies in programming language research. I'm a member of the LoReL research group and am currently pursuing my master's thesis on categorical models of linear intuitionistic logic, as part of a research program focused on defining quantum programming languages based on proof systems for linear logics.

I'm also part of the KAPOW research group, where I study the properties of random sequences and methods for generating them using tools from extremal graph theory.

Papers

Jul 2024De Bruijn Sequences with Minimum Discrepancy [ arXiv | pdf ]
- The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a binary de Bruijn sequence of order n can achieve, which is n. This was an open problem until now. We give an algorithm that constructs a binary de Bruijn sequence with minimal discrepancy. A slight modification of this algorithm deals with arbitrary alphabets and yields de Bruijn sequences of order n with discrepancy at most 1 above the trivial lower bound n.
Aug 2023On extremal factors of de Bruijn-like graphs [ arXiv | pdf ]
- Abstract: In 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles in the de Bruijn graphs of order n is attained by the pure cycling register rule, as conjectured by Golomb. We generalize this result to the tensor product of the de Bruijn graph of order n and a simple cycle of size k, when n divides k or vice versa. We also develop counting formulae for a large family of cycling register rules, including the linear register rules proposed by Golomb.