English
Related papers

Related papers: On equations over sets of integers

200 papers

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Rings and Algebras · Mathematics 2008-10-03 F. Cedo , E. Jespers , J. Okninksi

Solving math word problems is a challenging task that requires accurate natural language understanding to bridge natural language texts and math expressions. Motivated by the intuition about how human generates the equations given the…

Computation and Language · Computer Science 2019-06-11 Ting-Rui Chiang , Yun-Nung Chen

In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…

Logic in Computer Science · Computer Science 2016-07-18 Boas Kluiving , Wijnand van Woerkom

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

We study isometric representations of the semigroup $\mathbb{Z}_+\backslash \{1\}$. Notion of an inverse representation is introduced and a complete description (up to unitary equivalence) of such representations is given. Also, we study a…

Operator Algebras · Mathematics 2013-03-05 Suren A. Grigoryan , Vardan H. Tepoyan

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

Representation Theory · Mathematics 2007-05-23 Yona Cherniavsky , Eli Bagno

Let $S$ and $T$ be subsets of $\mathbf{F}_q^n$. We show there are subsets $S'$ of $S$ and $T'$ of $T$ such that $S+T$ is the union of $S+T'$ and $S'+T$, with $|S'| + |T'|$ bounded by $c^n$ with $c < q$. The proof relies on the method of…

Combinatorics · Mathematics 2017-09-08 Jordan S. Ellenberg

We discuss the optimal presentations of mathematical objects under well defined symbol libraries. We shall examine what light our chosen symbol libraries and syntax shed upon the objects they represent. A major part of this work will focus…

History and Overview · Mathematics 2018-12-04 Akshunna Shaurya Dogra

It is proved that all recursively enumerable sets of natural numbers can be represented by arithmetic formulas (of two kinds) with only 3 quantifiers.

Logic · Mathematics 2008-02-08 Yuri Matiyasevich , Julia Robinson

We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…

Quantum Algebra · Mathematics 2007-05-23 Alexander Odesskii , Vladimir Sokolov

We extend the symbolic representation to the ring of N=1 supersymmetric differential polynomials, and demonstrate that operations on the ring, such as the super derivative, Frechet derivative and super commutator, can be carried out in the…

Exactly Solvable and Integrable Systems · Physics 2016-07-15 Kai Tian , Jing Ping Wang

Over the last few decades, many distinct lines of research aimed at automating mathematics have been developed, including computer algebra systems (CASs) for mathematical modelling, automated theorem provers for first-order logic, SAT/SMT…

Logic in Computer Science · Computer Science 2019-09-18 Curtis Bright , Ilias Kotsireas , Vijay Ganesh

We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…

Computational Complexity · Computer Science 2019-04-09 P. W. Adriaans

Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Galina Jirásková , Alexander Okhotin

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

Rings and Algebras · Mathematics 2025-06-17 Hiroki Aoki , Hiraku Kawanoue

Consider the Deligne-Simpson problem: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ (resp. $c_j\subset gl(n,{\bf C})$) so that there exist irreducible $(p+1)$-tuples of…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Kostov

Hypercomplex numbers are unital algebras over the real numbers. We offer a short demonstration of the practical value of hypercomplex analytic functions in the field of partial differential equations.

General Mathematics · Mathematics 2016-09-13 David Harper

We consider some examples of quantum super-integrable systems and the associated nonlinear extensions of Lie algebras. The intimate relationship between super-integrability and exact solvability is illustrated. Eigenfunctions are…

Mathematical Physics · Physics 2008-04-24 Allan P. Fordy

We provide a new way to represent numerical semigroups by showing that the position of every Ap\'ery set of a numerical semigroup $S$ in the enumeration of the elements of $S$ is unique, and that $S$ can be re-constructed from this…

Commutative Algebra · Mathematics 2014-07-16 Lance Bryant , James Hamblin

Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…

Logic in Computer Science · Computer Science 2025-10-01 Luke Bayzid , Alexandre Madeira , Manuel A. Martins