相关论文: Continuous solutions to algebraic forcing equation…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

It is an open question whether tight closure commutes with localization in quotients of a polynomial ring in finitely many variables over a field. Katzman showed that tight closure of ideals in these rings commutes with localization at one…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Let $f=ax+x^{r(q-1)+1}\in \mathbb{F}_{q^2}^*[x], r\in \{5,7\}.$ We give explicit conditions on the values $(q,a)$ for which $f$ is a permutation polynomials of $\mathbb{F}_{q^2}.$

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

We obtain closed-form solutions of several inhomogeneous Lienard equations by the factorization method. The two factorization conditions involved in the method are turned into a system of first-order differential equations containing the…

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

We propose a new, game-theoretic, approach to the idealized forcing, in terms of fusion games. This generalizes the classical approach to the Sacks and the Miller forcing. For definable ($\mathbf{\Pi}^1_1$ on $\mathbf{\Sigma}^1_1)…

Consider a homogeneous multifold convex conic system $$ Ax = 0, \; x\in K_1\times...\times K_r $$ and its alternative system $$ A\transp y \in K_1^*\times...\times K_r^*, $$ where $K_1,..., K_r$ are regular closed convex cones. We show that…

The set of all m-tuples of compatible full conditional distributions on discrete random variables is an algebraic set whose defining ideal is a unimodular toric ideal. We identify the defining polynomials of these ideals with closed walks…

The core of an ideal is defined as the intersection of all of its reductions. In this paper we provide an explicit description for the core of a monomial ideal $I$ satisfying certain residual conditions, showing that ${\rm core}(I)$…

The F-threshold $c^J(\a)$ of an ideal $\a$ with respect to the ideal $J$ is a positive characteristic invariant obtained by comparing the powers of $\a$ with the Frobenius powers of $J$. We show that under mild assumptions, we can detect…

We investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial $P(x)\in \mathbb{Z}[x]$ and $n\in \mathbb{N}$, we consider the equation $P(K_n(x_1,\ldots, x_n)) =…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

This paper is concerned with the question of whether geometric structures such as cell complexes can be used to simultaneously describe the minimal free resolutions of all powers of a monomial ideal. We provide a full answer in the case of…

A generalized Melvin solution for an arbitrary simple finite-dimensional Lie algebra $\cal G$ is considered. The solution contains a metric, $n$ Abelian 2-forms and $n$ scalar fields, where $n$ is the rank of $\cal G$. It is governed by a…

We study the ideals of the closure of the polynomial multipliers on the Drury-Arveson space. Structural results are obtained by investigating the relation between an ideal and its weak-$*$ closure, much in the spirit of the corresponding…

The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Following work of Keel and Tevelev, we give explicit polynomials in the Cox ring of $\mathbb{P}^1\times\cdots\times\mathbb{P}^{n-3}$ that, conjecturally, determine $\overline{M}_{0,n}$ as a subscheme. Using Macaulay2, we prove that these…