Related papers: Class invariants by the CRT method
Given an action of a reductive group on a normal variety, we construct all invariant open subsets admitting a good quotient with a quasiprojective or a divisorial quotient space. Our approach extends known constructions like Mumford's…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
We develop a method to compute the Ekedahl-Oort type of a curve C over a field k of characteristic p (which is the isomorphism type of the p-kernel group scheme J[p], where J is the Jacobian of C). Part of our method is general, in that we…
In this paper, we introduce the notion of the diagonal property and the weak point property for an ind-variety. We prove that the ind-varieties of higher rank divisors of integral slopes on a smooth projective curve have the weak point…
In high-dimensional classification problems, a commonly used approach is to first project the high-dimensional features into a lower dimensional space, and base the classification on the resulting lower dimensional projections. In this…
We consider controllable linear discrete-time systems with bounded perturbations and present two methods to compute robust controlled invariant sets. The first method tolerates an arbitrarily small constraint violation to compute an…
In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…
Discriminating data classes emanating from sensors is an important problem with many applications in science and technology. We describe a new transform for pattern identification that interprets patterns as probability density functions,…
The rehearsal strategy is widely used to alleviate the catastrophic forgetting problem in class incremental learning (CIL) by preserving limited exemplars from previous tasks. With imbalanced sample numbers between old and new classes, the…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…
An invariant of a model of genus one curve is a polynomial in the coefficients of the model that is stable under certain linear transformations. The classical example of an invariant is the discriminant, which characterizes the singularity…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…
In 1994, Kani introduced an algebraic version of the Humbert invariant, known as the refined Humbert invariant. This invariant q_C is a positive definite quadratic form attached to a smooth curve C of genus 2. It serves as a vital tool, as…
We show that elliptic curves with complex multiplication (CM) naturally emerge in the spectral geometry of Hermitian one-matrix models in the two-cut phase. Focusing on a symmetric quartic potential, we derive the corresponding genus-one…
We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…
Chinese remainder theorem (CRT) is widely applied in cryptography, coding theory, and signal processing. It has been extended to the multidimensional CRT (MD-CRT), which reconstructs an integer vector from its vector remainders modulo…
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under…
In this article, we study properties of the exponential Hilbert series of a $G$-equivariant projective variety, where $G$ is a semisimple, simply-connected complex linear algebraic group. We prove a relationship between the exponential…