Related papers: Constructive characterization of the reduction num…
In this paper we extend the characterisation of kernels in semirings as subtractive ideals to general algebras. We then analyse the counterparts of ``subtractive'' and ``ideal'' in several different algebraic settings.
This paper aims to build a new understanding of the nonstandard mathematical analysis. The main contribution of this paper is the construction of a new set of numbers, $\mathbb{R}^{\mathbb{Z}_< }$, which includes infinities and…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…
We review some definitions and basic notions relating to generalised spin structures and introduce the notion of reducibility. We discuss connections on these structures, define a covariant Lie derivative for associated bundles and develop…
The first sections contain a survey of the application of the Knuth-Robinson-Schensted corerspondence to the computation of Groebner bases of determinantal ideals. We also set up a conceptual framework for this application in terms of…
Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…
Small model property is an important property that implies decidability. We show that the small model size is directly related to some important resources in games and automata for checking provability.
There are many ways to construct the field R of real numbers. The most important and famous of these employ Cauchy sequences (Cantor) or cuts (Dedekind) in the field Q of rational numbers. These constructions sometimes overlook important…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to…
The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…
The primary research questions of this paper center on defining the amount of context that is necessary and/or appropriate when investigating the relationship between language model probabilities and cognitive phenomena. We investigate…
A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…
We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.
We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…
In this (mostly expository) paper I want to share some observations prompted by a class of matrices whose determinants are Catalan numbers. Considering different methods of proof we obtain some generalizations and q-analogues and…