Related papers: Computing Hypercircles by Moving Hyperplanes

This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…

A new class of rational parametrization has been developed and it was used to generate a new family of rational functions B-splines $\displaystyle{{\left({}^{\alpha}{\mathbf B}_{i}^{k} \right)}_{i=0}^{k}}$ which depends on an index $\alpha…

We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free. Specifically, the optimization problem of the…

Let phi and psi be endomorphisms of the projective line of degree at least 2, defined over a noetherian commutative ring R with unity. From a dynamical perspective, a significant question is to determine whether phi and psi are conjugate…

The circular coordinates algorithm, a key tool in topological data analysis, relies on a theoretically unvalidated lifting step to convert cocycles from a prime field to integer coefficients. We provide a rigorous analysis of this…

Let $S$ be a closed orientable hyperbolic surface, and let $\mathcal{O}(K,S)$ denote the number of mapping class group orbits of curves on $S$ with at most $K$ self-intersections. Building on work of Sapir [16], we give upper and lower…

We present an algorithm which, given a deformation with trivial section of a reduced plane curve singularity, computes equations for the equisingularity stratum (that is, the mu-constant stratum in characteristic 0) in the parameter space…

The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…

Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. The structure of CSPs is best described by hypergraphs. Therefore,…

The task of hyper-parameter optimization (HPO) is burdened with heavy computational costs due to the intractability of optimizing both a model's weights and its hyper-parameters simultaneously. In this work, we introduce a new class of HPO…

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…

We investigate the completely positive semidefinite cone $\mathcal{CS}_+^n$, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular we study…

We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…

Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…

A version of the Hardy-Littlewood circle method is developed for number fields K/Q and is used to show that non-singular projective cubic hypersurfaces over K always have a K-rational point when they have dimension at least 8.

Given a smooth curve defined over a field $k$ that admits a non-singular plane model over $\overline{k}$, a fixed separable closure of $k$, it does not necessarily have a non-singular plane model defined over the field $k$. We determine…

For a projective curve $C\subset\mathbf{P}^n$ defined over $\mathbf{F}_q$ we study the statistics of the $\mathbf{F}_q$-structure of a section of $C$ by a random hyperplane defined over $\mathbf{F}_q$ in the $q\to\infty$ limit. We obtain a…

Let k=F_q be a finite field of even characteristic. We obtain in this paper a complete classification, up to k-isomorphism, of non singular quartic plane curves defined over k. We find explicit rational normal models and we give closed…

For a $k$-uniform hypergraph $F$ we consider the parameter $\Theta(F)$, the minimum size of a clique cover of the of $F$. We derive bounds on $\Theta(F)$ for $F$ belonging to various classes of hypergraphs.