Related papers: Linearization in ultrametric dynamics in fields of…

We investigate the supersymmetric extension of k-field models, in which the scalar field is described by generalized dynamics. We illustrate some results with models that support static solutions with the standard kink or the compact…

Consider a standard graded artinian $k$-algebra $B$ and an extension of $B$ by a new variable, $A=B\otimes_k k[x]/(x^d)$ for some $d\geq 1$. We will show how maximal rank properties for powers of a general linear form on $A$ can be…

Invariants of generalized tensor fields on a line are classified using special polynomials P_mk^(-1/lambda) introduced here for this purpose. For the case of positive characteristic, a new invariant of formal power series, a width, is…

Let $K$ be an unramified $p$-adic local field and let $W$ be the ring of integers of $K$. Let $(X,S)/W$ be a smooth proper scheme together with a normal crossings divisor. We show that there are only finitely many log crystalline $\mathbb…

Let f be a dominant rational map of P^k such that there exists s <k, with lambda_s(f)>lambda_l(f) for all l. Under mild hypotheses, we show that, for A outside a pluripolar set of the group of automorphisms of P^k, the map f o A admits a…

For a field extension $L/K$ we consider maps that are quadratic over $L$ but whose polarisation is only bilinear over $K$. Our main result is that all such are automatically quadratic forms over $L$ in the usual sense if and only if $L/K$…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

We consider several characterizations of $\mathbb R$-linear mappings. In particular, we give a characterization of linear mappings whose range is $\geq$ 2 dimensional, in terms of preservation of lines (and contraction of lines to a point)…

We obtain lower bounds for the maximum dimension of a simple FG-module, where G is a finite group and F is an algebraically closed field of characteristic p. The bounds are described in terms of properties of p-subgroups of G. When p is 2…

Maximum margin binary classification is one of the most fundamental algorithms in machine learning, yet the role of featurization maps and the high-dimensional asymptotics of the misclassification error for non-Gaussian features are still…

We show that maximal families of mutually unbiased bases are characterized in all dimensions by partitioned unitary error bases, up to a choice of a family of Hadamards. Furthermore, we give a new construction of partitioned unitary error…

Completely positive trace preserving maps are widely used in quantum information theory. These are mostly studied using the master equation perspective. A central part in this theory is to study whether a given system of dynamical maps…

It is known that Paley graphs of square order have the strict-EKR property, that is, all maximum cliques are canonical cliques. Peisert-type graphs are natural generalizations of Paley graphs and some of them also have the strict-EKR…

In this paper, we study arithmetic dynamics in arbitrary characteristic, in particular in positive characteristic. We generalise some basic facts on arithmetic degree and canonical height in positive characteristic. As applications, we…

Let $F$ be a number field, let $N\geq 3$ be an integer, and let $k$ be a finite field of characteristic $\ell$. We show that if $\rb:G_F\longrightarrow GL_N(k)$ is a continuous representation with image of $\rb$ containing $SL_N(k)$ then,…

We study numerically the zero temperature Random Field Ising Model on cubic lattices of various linear sizes $L$ in three dimensions. For each random field configuration we vary the ferromagnetic coupling strength $J$. We find that in the…

We give some classes of power maps with low $c$-differential uniformity over finite fields of odd characteristic, {for $c=-1$}. Moreover, we give a necessary and sufficient condition for a linearized polynomial to be a perfect $c$-nonlinear…

We study how much a linear program (LP) can be compressed when solved repeatedly, given prior knowledge about its objective function. Existing data-driven projection methods learn low-dimensional surrogate LPs with approximate…

We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical $(k,k)$-designs and provide certain examples, including unit-norm tight frames, that attain these…

In 1988, S. V. Okhitin proved that for any field k of characteristic zero, the T-space CP(M_2(k)) is finitely based, and he raised the question as to whether CP(A) is finitely based for every (unitary) associative algebra A with nonzero…