Related papers: Integer Complexity Generalizations in Various Ring…

There is no single universally accepted definition of "Complexity". There are several perspectives on complexity and what constitutes complex behaviour or complex systems, as opposed to regular, predictable behaviour and simple systems. In…

We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…

We begin with the observation that the signed generalized Stirling polynomials $P_k(m,x)$, which occur in a generalization of Malmsten's integral, reduce to the falling factorials when $k=m$. The structure of these generalized Stirling…

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…

In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over $\mathbb{Z}/q_1\mathbb{Z} \times \cdots \times \mathbb{Z}/q_n\mathbb{Z}$ and derive a Singleton-like bound for…

Lyubeznik conjectured that local cohomology modules of regular rings have finitely many associated primes. We examine this conjecture for polynomial rings over the integers, and record some equational identities that arise from studying…

Littlewood polynomials are polynomials with each of their coefficients in {-1,1}. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

In this article we extend a previous definition of Castelnuovo-Mumford regularity for modules over an algebra graded by a finitely generated abelian group. Our notion of regularity is based on Maclagan and Smith's definition, and is…

We prove very general index formulae for integral Galois modules, specifically for units in rings of integers of number fields, for higher K-groups of rings of integers, and for Mordell-Weil groups of elliptic curves over number fields.…

Motivated by applications to the theory of rank-metric codes, we study the problem of estimating the number of common complements of a family of subspaces over a finite field in terms of the cardinality of the family and its intersection…

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

We develop the theory of root clusters further in this article and give some applications. We introduce some new notions as well as recall earlier notions for field extensions over a perfect base field: root cluster size, its generalization…

This paper considers graded near-rings over a monoid G as a generalizations of the graded rings over groups, introduce certain innovative graded weakly prime ideals and graded almost prime ideals as a generalizations of graded prime ideals…

We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…

Let p be an odd prime. Let F_p^* be the no-null part of the finite field of p elements. Let K=\Q(zeta) be a p-cyclotomic field and O_K be its ring of integers. Let pi be the prime ideal of K lying over p. Let sigma : zeta --> zeta^v be the…

We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…