Related papers: On schemes evinced by generalized additive decompo…
We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…
We expand the existing arsenal of methods for exploring the irreducible components of the varieties $Rep(A,\bold d)$ which parametrize the representations with dimension vector $\bold d$ of a finite dimensional algebra $A$. To do so, we…
We construct a class of novel tamed schemes that can preserve the original Lyapunov functional for super-linear stochastic PDEs (SPDEs), including the stochastic Allen--Cahn equation, driven by multiplicative or additive noise, and provide…
We determine the regular irreducible components of the variety mod(A,d), where A=kQ/I is a string algebra and I is generated by a set of paths of length two. Our case is among the first examples of descriptions of irreducible components,…
We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
We call a finite-dimensional K-algebra A geometrically irreducible if for all d, all connected components of the affine scheme of d-dimensional A-modules are irreducible. We show that the geometrically irreducible algebras without loops…
Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…
I extend the definitions of schemes relative to monoids with zero - and therefore, toric geometry - to the world of formal schemes. This expands the usual framework to include, for instance, models for Mumford's degenerating Abelian…
Adjacent dyadic systems are pivotal in analysis and related fields to study continuous objects via collections of dyadic ones. In our prior work (joint with Jiang, Olson and Wei) we describe precise necessary and sufficient conditions for…
A polynomial is a direct sum if it can be written as a sum of two non-zero polynomials in some distinct sets of variables, up to a linear change of variables. We analyze criteria for a homogeneous polynomial to be decomposable as a direct…
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…
A new algorithm to compute cylindrical algebraic decompositions (CADs) is presented, building on two recent advances. Firstly, the output is truth table invariant (a TTICAD) meaning given formulae have constant truth value on each cell of…
Let $A$ be an associative algebra over an algebraically closed field $K$ of characteristic 0. A decomposition $A=A_1\oplus\cdots \oplus A_r$ of $A$ into a direct sum of $r$ vector subspaces is called a \textsl{regular decomposition} if, for…
Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
We prove the existence of infinite classes of cyclic G-decompositions of the complete multipartite graph, G being a caterpillar, a hairy cycle or a cycle. All the results are obtained by the construction of d-divisible $\alpha$-labelings of…
The two main theorems proved here are as follows: If $A$ is a finite dimensional algebra over an algebraically closed field, the identity component of the algebraic group of outer automorphisms of $A$ is invariant under derived equivalence.…