相关论文: The complexity of elliptic normal bases
We prove that the geodesic complexity of a regular tetrahedron exceeds its topological complexity by 1 or 2. The proof involves a careful analysis of minimal geodesics on the tetrahedron.
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
This survey paper concerns elliptic surfaces with section. We give a detailed overview of the theory including many examples. Emphasis is placed on rational elliptic surfaces and elliptic K3 surfaces. To this end, we particularly review the…
This paper studies the essential normality of Bergman modules over the intersection of complex ellipsoids, as well as their quotients by monomial ideals.
In many studies, it is common to use binary (i.e., unweighted) edges to examine networks of entities that are either adjacent or not adjacent. Researchers have generalized such binary networks to incorporate edge weights, which allow one to…
Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
We propose a variant of elliptic multiple polylogarithms that have at most logarithmic singularities in all variables and satisfy a differential equation without homogeneous term. We investigate several non-trivial elliptic two-loop Feynman…
Gradient boundedness up to the boundary for solutions to Dirichlet and Neumann problems for elliptic systems with Uhlenbeck type structure is established. Nonlinearities of possibly non-polynomial type are allowed, and minimal regularity on…
The theory of elliptic pairs, as investigated in a paper by Castravet, Laface, Tevelev, and Ugaglia, provides useful conditions to determine polyhedrality of the pseudo-effective cone, which give rise to interesting arithmetic questions…
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…
We consider dynamical systems for which the spatial extension plays an important role. For these systems, the notions of attractor, epsilon-entropy and topological entropy per unit time and volume have been introduced previously. In this…
The ellipsoidal superpotential of the complex projective plane can be interpreted as a count of rigid rational plane curves of a given degree with one prescribed cusp singularity. In this note we present a closed formula for these counts as…
We explain the construction of minimal tilting complexes for objects of highest weight categories and we study in detail the minimal tilting complexes for standard objects and simple objects. For certain categories of representations of…
We introduce the class of piecewise convex transformations, and study their complexity. We apply the results to the complexity of polygonal billiards on surfaces of constant curvature.
We derive a number of summation and transformation formulas for elliptic hypergeometric series on the root systems A_n, C_n and D_n. In the special cases of classical and q-series, our approach leads to new elementary proofs of the…
Simplicial complexes describe collaboration networks, protein interaction networks and brain networks and in general network structures in which the interactions can include more than two nodes. In real applications, often simplicial…
We obtain the global weighted $W^{1,p}$ estimates for weak solutions of nonlinear elliptic equations over Reifenberg flat domains. Where nonlinearity $A(x,z,\xi)$ is assumed to be local uniform continuous in $z$ and have small BMO semi-norm…
We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…