Related papers: Motivated exposition of combinatorial Nullstellens…

Let F denote either the real or complex field. An ideal I in the free *-algebra F<x,x*> in g freely noncommuting variables and their formal adjoints is a *-ideal if I = I*. When a real *-ideal has finite codimension, it satisfies a strong…

Let $V$ be a real algebraic variety with singularities and $f$ be a real polynomial non-negative on $V$. Assume that the regular locus of $V$ is dense in $V$ by the usual topology. Using Hironaka's resolution of singularities and…

Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…

By presenting the proofs of a few sample results, we introduce the reader to the use of nonstandard analysis in aspects of combinatorics of numbers.

We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…

We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain…

We show that Zilber's conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in…

We survey several results connecting combinatorics and Wronskian solutions of the KP equation, contextualizing the successes of a recent approach introduced by Kodama, et. al. We include the necessary combinatorial and analytical background…

This paper is primarily intended as an introduction for the mathematically inclined to some of the rich algebraic combinatorics arising in for instance CFT. It is essentially self-contained, apart from some of the background motivation and…

In this paper, firstly, we mainly study the relationship of balanced pairs among three Abelian categories in a recollement. As an application of admissible balanced pairs, we introduce the notion of the relative tilting modules, and give a…

This paper examines order three elements of finite groups which normalize no nontrivial 2-subgroup. The motivation for finding such elements arises out of a problem in modular representation theory. The question of when these elements…

Roughly speaking a solitary wave is a solution of a field equation whose energy travels as a localized packet and which preserves this localization in time. A soliton is a solitary wave which exhibits some strong form of stability so that…

We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive…

This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…

This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…

In 1996, my brilliant student John Noonan, discovered, and proved that there are 3(2n)!/(n(n+3)!(n-3)!) ways to line-up n people of different heights in such a way that out of the n(n-1)(n-2)/6 possible triples of people exactly one is such…

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

These notes find a canonical representation of the $\aleph_0$-categorical linear orders based on Joseph Rosenstein's description. A unique minimal representation, called the normal form, is obtained.