🔢 mathematics

Lissajous Varieties

This paper investigates affine algebraic varieties parametrized by sine and cosine functions, establishing that their degrees correspond to polytope volumes, deriving their defining equations via polynomial matrix rank constraints, and exploring their applications in dynamical systems like the Kuramoto model alongside connections to convex optimization and discriminants.

Original authors: Francesco Maria Mascarin, Simon Telen

Published 2026-02-19

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Francesco Maria Mascarin, Simon Telen

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: Dancing Dots and Hidden Shapes

Imagine you have a bunch of dancers on a stage. Each dancer is moving back and forth in a simple, rhythmic wave (like a sine or cosine wave). In math, we call these Lissajous figures. Usually, we just look at two dancers moving on a flat floor (2D), creating pretty loops and figure-eights.

This paper asks a big question: What happens if we have many dancers moving in complex patterns, and we try to draw the shape of the entire group's movement?

The authors, Francesco Maria Mascarin and Simon Telen, discovered that these complex groups of dancers don't just make random scribbles. They form precise, hidden geometric shapes called algebraic varieties. These shapes are like invisible sculptures in a high-dimensional space. The paper is a guidebook on how to find the blueprint for these sculptures, how big they are, and how they relate to real-world problems like power grids and swarms of fireflies.

1. The "Cosine Machine" (What is a Lissajous Variety?)

Think of a Lissajous Variety as a machine that takes a straight line (or a flat sheet) of coordinates and squishes it through a "cosine filter."

The Input: Imagine a flat sheet of paper floating in space. Every point on this sheet has coordinates $(t_1, t_2, \dots)$ .
The Filter: The machine takes every coordinate and turns it into a cosine value: $\cos(t_1), \cos(t_2), \dots$ .
The Output: The result is a curved, wiggly shape in a new space.

The Analogy: Imagine you have a straight rubber band. You stretch it out, then you press it against a wavy wall. The shadow the rubber band casts on the wall is the "Lissajous Variety." The paper figures out exactly what that shadow looks like, even if the rubber band is in 100 dimensions.

2. Measuring the Shape (The Degree and the Polytope)

One of the paper's main discoveries is a way to measure the "size" or complexity of these shapes without drawing them.

The Problem: How many times does this wiggly shape cross a straight line? (In math, this is called the degree).
The Solution: The authors found a shortcut. They realized the complexity of the shape is directly related to the volume of a specific 3D (or multi-dimensional) box called a polytope.

The Analogy: Imagine you want to know how many bricks are in a weirdly shaped castle. Instead of counting them one by one, you realize the castle's size is exactly equal to the volume of a giant, invisible cardboard box you could build around it.

If the box is small, the shape is simple (like a circle).
If the box is huge and complex, the shape is wild and intricate.
The paper gives a formula: Complexity = Volume of the Box.

3. The "Rank Check" (How to Write the Rules)

How do you actually write down the equation for these shapes? Usually, you need a long list of rules (equations). The authors found a clever trick using matrices (grids of numbers).

The Analogy: Imagine you are trying to identify a suspect in a crowd. You don't need to check every single person's face. Instead, you check a specific "ID card" (a matrix). If the ID card looks "broken" (has low rank), then the person is the suspect.

The paper shows that if you build a specific matrix using the coordinates of a point, and that matrix looks "broken," then that point is part of the Lissajous shape.
This turns a hard geometry problem into a simple algebra check.

4. The Firefly Connection (The Kuramoto Model)

The most exciting part of the paper is how this math applies to the real world, specifically the Kuramoto Model. This model describes how things synchronize, like:

Fireflies flashing in unison.
Heart cells beating together.
Power generators in an electrical grid staying in sync.

The Analogy: Imagine a swarm of fireflies. Each one has its own rhythm, but they influence each other. Sometimes they all sync up perfectly; sometimes they go crazy and flash randomly.

The "steady state" (when they are all synced) corresponds to a specific point on the Lissajous shape.
The paper proves that finding the "perfect sync" is the same as finding the lowest point in a valley on a hill.
The "Hill": A mathematical landscape where the height represents energy.
The "Valley": The stable, synchronized state.
The Magic: The authors show that finding this stable state is a Convex Optimization problem. This means computers can find the solution incredibly fast, even for huge swarms of fireflies, because the "hill" has no hidden traps or fake valleys.

5. The "Tipping Point" (Discriminants)

Finally, the paper studies what happens when you change the conditions (like changing the natural rhythm of the fireflies).

The Analogy: Imagine balancing a pencil on its tip. As long as you are careful, it stays upright. But if you push it just a tiny bit too far, it falls. The line where it falls is the Discriminant.

The paper maps out these "tipping points" for the Lissajous shapes.
If the parameters (like the frequency of the oscillators) stay inside a certain safe zone, the system is stable.
If they cross the "Discriminant Line," the system breaks (the fireflies stop syncing, or the power grid fails).
The authors calculated how complex these "danger zones" are, showing they can be surprisingly intricate shapes.

Summary: Why Does This Matter?

This paper is a bridge between pure geometry and real-world engineering.

It gives us a ruler: We can now measure the complexity of these high-dimensional shapes using simple volumes.
It gives us a map: We can write down the exact rules for these shapes using matrices.
It saves time: By realizing that finding stable states in complex systems (like power grids) is a simple "lowest point" problem, we can solve them instantly instead of guessing.

In short, the authors took a beautiful, abstract dance of numbers and showed us that it holds the secret to keeping our lights on and our fireflies flashing in time.

1. Problem Statement and Motivation

The paper investigates affine algebraic varieties parametrized by sine and cosine functions, generalizing classical planar Lissajous figures to higher dimensions.

Core Object: Given a rational matrix $A \in \mathbb{Q}^{d \times n}$ and a vector $b \in \mathbb{C}^n$ , the authors define the variety $L_{A,b}$ as the image of an affine-linear subspace (a translate of the row space of $A$ ) under the coordinate-wise cosine map:
$L_{A,b} = \cos(\text{Row}(A) - b\frac{\pi}{2}) \subset \mathbb{C}^n$
Special cases include $C_A = L_{A,0}$ (Chebyshev varieties) and $S_A = L_{A,1}$ (related to sine parametrizations).
Motivation: These varieties arise naturally in the study of dynamical systems, specifically the Kuramoto model of coupled oscillators. The steady states (equilibrium points) of these systems correspond to the intersection of $S_A$ with an affine-linear space defined by natural frequencies.
Goals: The authors aim to determine the degree of these varieties, find their defining equations, and analyze their discriminants to understand bifurcation phenomena in dynamical systems.

2. Methodology

The authors employ a blend of algebraic geometry, toric geometry, and convex optimization.

Toric Parametrization: They utilize Euler's identity to rewrite the cosine map in terms of Laurent monomials. Specifically, $L_{A,b}$ is shown to be the image of a scaled affine toric variety $Y_{A,\beta}$ under a projection map. This connects the problem to the well-understood theory of toric varieties.
Degree Calculation: The degree of $L_{A,b}$ is computed by relating the variety to a polytope $P_A$ (the convex hull of $\{\pm a_1, \dots, \pm a_n\}$ ). They apply Kushnirenko's Theorem (a generalization of Bézout's theorem for Laurent polynomials) to count the number of solutions to a generic linear section.
Defining Equations: Instead of standard elimination, they construct a determinantal representation. They define a ring of operators acting on a quotient space derived from the relation $2x_j = y_j + y_j^{-1}$ . The defining equations of $L_{A,b}$ are derived from the rank constraints of a matrix with polynomial entries constructed from these operators.
Optimization Connection: For the specific case of $S_A$ (sine parametrization), the authors identify a subset of the variety, $S_A^+$ , which corresponds to the image of a convex polytope under the sine map. They prove that points in this subset are unique minimizers of a specific strictly convex optimization problem.
Discriminant Analysis: They define the Lissajous discriminant $\nabla_{A,b}$ as the branch locus of the projection of the variety. This is computed via the vanishing of a toric Jacobian determinant, linking the geometry to the stability of dynamical systems.

3. Key Contributions and Results

A. Degree Formula

The paper establishes a precise formula for the degree of $L_{A,b}$ (Theorem 1.4 and 2.3).

Result: For generic $b$ , the degree is given by:
$\deg(L_{A,b}) = \frac{d! \cdot \text{vol}(P_A)}{2^{C_{LA}}}$
where $d! \cdot \text{vol}(P_A)$ is the normalized volume of the polytope $P_A$ , and $C_{LA}$ is the number of "coloops" (entries that are zero in generic kernel vectors).
Significance: This provides a combinatorial interpretation of the algebraic complexity of these varieties. For example, the degree of the cycle polynomial $\Gamma'_n$ is explicitly calculated as $\frac{n}{2} \binom{n-1}{\lfloor \frac{n-1}{2} \rfloor}$ .

B. Determinantal Equations

The authors provide a constructive method to find defining equations (Theorem 3.1).

Method: They construct a $2n \times (r \cdot 2n)$ matrix (where $r = n - \text{rank}(A)$ ) whose maximal minors generate the defining ideal set-theoretically.
Application: This allows for the computation of equations for varieties that are difficult to handle via standard Gröbner basis elimination, such as the degree-6 surface $S_A$ in Example 1.3.

C. Connection to Convex Optimization and Kuramoto Model

A major contribution is the link between algebraic geometry and stability in the Kuramoto model (Sections 4 and 5).

Stable Equilibria: The authors prove that the linearly stable equilibrium of the Kuramoto system corresponds to a point in the "positive part" of the variety ( $S_A^+$ ).
Optimization Characterization: This stable equilibrium is the unique solution to a convex optimization problem (minimizing a sum of strictly convex functions subject to linear constraints).
Implication: This offers a computationally efficient method (using convex solvers) to find stable equilibria, bypassing the need to solve the full system of high-degree polynomial equations which may have many "spurious" unstable solutions.

D. Lissajous Discriminants

The paper introduces and analyzes the Lissajous discriminant $\nabla_{A,b}$ (Section 6).

Definition: The locus of parameters $\omega$ where the number of real solutions changes (bifurcation points).
Degree Bound: They derive an upper bound for the degree of the discriminant based on the mixed volume of polytopes (Theorem 6.8).
Symmetries: If $A$ is the incidence matrix of a graph $G$ , the discriminant inherits the symmetries of the automorphism group $\text{Aut}(G)$ .
Examples: They compute explicit discriminants for cycle graphs ( $C_n$ ) and complete graphs ( $K_n$ ), showing how the discriminant separates regions of different numbers of real solutions.

4. Significance and Impact

Unification: The paper unifies the study of Lissajous curves, Chebyshev varieties, and Kuramoto models under a single algebraic geometric framework.
Computational Efficiency: By identifying the stable equilibria of coupled oscillators as solutions to convex optimization problems, the work provides a practical alternative to solving complex polynomial systems, which is crucial for large-scale networks.
New Invariants: The introduction of the "Lissajous discriminant" provides a new tool for bifurcation analysis in dynamical systems, with explicit degree bounds and symmetry properties derived from graph theory.
Algebraic Geometry Applications: The results extend the understanding of the degrees and defining equations of varieties parametrized by trigonometric functions, bridging the gap between classical transcendental parametrizations and modern algebraic geometry.

In summary, Mascarin and Telen provide a rigorous algebraic foundation for Lissajous varieties, offering new formulas for their degrees, constructive methods for their equations, and a powerful optimization-based approach to analyzing the stability of coupled oscillator networks.