相关论文: Degree bound for toric envelope of a linear algebr…

For every odd integer $n \geq 3$, we prove that there exist infinitely many number fields of degree $n$ and associated Galois group $S_n$ whose class number is odd. To do so, we study the class groups of families of number fields of degree…

For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…

A unifying overview of the ways to parameterize the linear group GL(4.C) and its subgroups is given. As parameters for this group there are taken 16 coefficients G = G(A,B,A_{k}, B_{k}, F_{kl}) in resolving matrix G in terms of 16 basic…

In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} \deg_G(u) \sqrt{\ln \deg_G(u)}$ and the variable sum exdeg index $SEI_a(G)$ for $a>0$, $a\neq 1$. We present…

Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first…

We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…

Given a hypersurface in a complex projective space, we prove that the multidegrees of its toric polar map agree, up to sign, with the coefficients of the Chern-Schwartz-MacPherson class of a distinguished open set, namely the complement of…

We study the size of the shadow of $k$-uniform hypergraphs with bounded degree. Lower bounds on the ratio of the size of the shadow and the size of the hypergraph are given as a function of the degree bound and $k$. We show that cliques are…

Enhancing and essentially generalizing previous results on a class of (1+1)-dimensional nonlinear wave and elliptic equations, we apply several new techniques to classify admissible point transformations within this class up to the…

In this paper, we study the problem of tropicalizing tame degree three coverings of the projective line. Given any degree three covering $C\longrightarrow{\mathbb{P}^{1}}$, we give an algorithm that produces the Berkovich skeleton of $C$.…

Counting number fields with prescribed Galois group is an enduring challenge in arithmetic statistics. Using the determinant method, we provide an upper bound for even groups, which is new in some cases.

In 2018, Legrand and Paran proved a weaker form of the Inverse Galois Problem for all Hilbertian fields and all finite groups: that is, there exist possibly non-Galois extensions over given Hilbertian base field with given finite group as…

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…

Let $K$ be a number field and $E_1, \ldots, E_n$ be elliptic curves over $K$, pairwise non-isogenous over $\overline{K}$ and without complex multiplication over $\overline{K}$. We study the image of the adelic representation of the absolute…

Fix an abelian variety $A$ of dimension $g\geq 1$ defined over a number field $K$. For each prime $\ell$, the Galois action on the $\ell$-power torsion points of $A$ induces a representation $\rho_{A,\ell}\colon Gal_K \to…

The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…

It is well known that the Tchebotarev density theorem implies that an irreducible $\ell$-adic representation $\rho$ of the absolute Galois group of a number field $K$ is determined (up to isomorphism) by the characteristic polynomials of…

An algorithmic upper bound on the domination number $\gamma$ of graphs in terms of the order $n$ and the minimum degree $\delta$ is proved. It is demonstrated that the bound improves best previous bounds for any $5\le \delta \le 50$. In…

Let $A$ be an absolutely simple abelian variety without (potential) complex multiplication, defined over the number field $K$. Suppose that either $\dim A=2$ or $A$ is of $\operatorname{GL}_2$-type: we give an explicit bound $\ell_0(A,K)$…