Related papers: On fields and colours
In this paper, we proved two results regarding the arithmetics of separably $\mathbb{A}^1$-connected varieties of rank one. First we proved over a large field, there is an $\mathbb{A}^1$-curve through any rational point of the boundary, if…
We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…
The article focuses on a class of second countable groups assembled from profinite and discrete by elementary operations. We focus on a rank associated with these groups that measure their complexity, the decomposition rank. A collection of…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
A class of two dimensional field theories, based on (generically degenerate) Poisson structures and generalizing gravity-Yang-Mills systems, is presented. Locally, the solutions of the classical equations of motion are given. A general…
We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…
We study rational homology groups of one-point compactifications of spaces of complex monic polynomials with multiple roots. These spaces are indexed by number partitions. A standard reformulation in terms of quotients of orbit arrangements…
We show that finding rank-$R$ decompositions of a 3D tensor, for $R\le 4$, over a fixed finite field can be done in polynomial time. However, if some cells in the tensor are allowed to have arbitrary values, then rank-2 is NP-hard over the…
The arboricity of a graph G is the minimum number of colours needed to colour the edges of G so that every cycle gets at least two colours. Given a positive integer p, we define the generalized p-arboricity Arb_p(G) of a graph G as the…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
Let $k$ be a field of characteristic zero and let $K=k(t)$ be the rational function field over $k$. In this paper we combine a formula of Ulmer for ranks of certain Jacobians over $K$ with strong upper bounds on endomorphisms of Jacobians…
On a generalized flag variety of rank one, we count rational approximations to a real point chosen randomly according to the Riemannian volume. In particular, our results apply to Grassmann varieties and quadric hypersurfaces. The proof…
We continue the examination of the stable reduction and fields of moduli of G-Galois covers of the projective line over a complete discrete valuation field of mixed characteristic (0, p), where G has a cyclic p-Sylow subgroup P of order…
In the previous work, Lim and the author determined the rank variety of the simple $\mathbb{F}\mathfrak{S}_{kp}$-module $D(p-1)=D^{(kp-p+1,1^{p-1})}$ with respect to some maximal elementary abelian $p$-subgroup $E_k$ and the complexity when…
We produce explicit elliptic curves over \Bbb F_p(t) whose Mordell-Weil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and Swinnerton-Dyer for these curves (or rather the Tate conjecture for related…
We give a criterion of the semisimplicity of a p-adic unitary representation of a topological monoid by the reduction of the associated operator algebra.
We consider the structure $(\mathbb{Z},+,0,|_{p_{1}},\dots,|_{p_{n}})$, where $x|_{p}y$ means $v_{p}(x)\leq v_{p}(y)$ and $v_p$ is the $p$-adic valuation. We prove that its theory has quantifier elimination in the language…
We propose and investigate a simple ranking-measure-based extension semantics for abstract argumentation frameworks based on their generic instantiation by default knowledge bases and the ranking construction semantics for default…
We consider semidefinite relaxations of Stable-Set and Coloring, which are based on quadratic 0-1 optimization. Information about the stability number and the chromatic number is hidden in the objective function. This leads to simplified…
Proposed the computerized method for calculating the relative level of order composites. Correlation between a level of structure order and properties of solids is shown. Discussed the possibility of clarifying the terminology used in…