Related papers: Singer difference sets and the projective norm gra…

A reduced divisor on a nonsingular variety defines the sheaf of logarithmic 1-forms. We introduce a certain coherent sheaf whose double dual coincides with this sheaf. It has some nice properties, for example, the residue exact sequence…

We investigate the geography of Hilbert schemes parametrizing closed subschemes of projective space with specified Hilbert polynomials. We classify Hilbert schemes with unique Borel-fixed points via combinatorial expressions for their…

Computing the cohomology of the 2-primary Steenrod algebra $\mathbb{A}$ is a central problem in algebraic topology, as it forms the $E_2$-term of the Adams spectral sequence converging to the stable homotopy groups of spheres. The Singer…

The extended weight semigroup of a homogeneous space G/H of a connected semisimple algebraic group G characterizes the spectra of the representations of G on the spaces of regular sections of homogeneous linear bundles over G/H, including…

A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…

Let $K$ be an infinite field and let $m_1,\ldots,m_n$ be a generalized arithmetic sequence of positive integers, i.e., there exist $h, d, m_1 \in\mathbb{Z}^+$ such that $m_i = h m_1 + (i-1)d$ for all $i \in \{2,\ldots,n\}$. We consider the…

Let $\mathscr A$ denote the classical singly-graded Steenrod algebra over the binary field $\mathbb Z/2.$ We write $P_k:=\mathbb Z/2[t_1, t_2, \ldots, t_k]$ as the polynomial algebra on $k$ generators, each having a degree of one. Let…

In the conventional formulation of N=1 supersymmetry, a vector multiplet is supposed to be in the adjoint representation of a given gauge group. We present a new formulation with a vector multiplet in the non-adjoint representation of SO(N)…

We study the Borel complexity of sets of normal numbers in several numeration systems. Taking a dynamical point of view, we offer a unified treatment for continued fraction expansions and base $r$ expansions, and their various…

We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…

In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

Fisher's linear discriminant analysis is a classical method for classification, yet it is limited to capturing linear features only. Kernel discriminant analysis as an extension is known to successfully alleviate the limitation through a…

The distinguishing number of a graph $G$ is the smallest positive integer $r$ such that $G$ has a labeling of its vertices with $r$ labels for which there is no non-trivial automorphism of $G$ preserving these labels. Albertson and Collins…

A cut $C:=\partial(X)$ of a matching covered graph $G$ is a separating cut if both its $C$-contractions $G/X$ and $G/\overline{X}$ are also matching covered. A brick is solid if it is free of nontrivial separating cuts. In 2004, we…

We construct a new subfactor planar algebra, and as a corollary a new subfactor, with the `extended Haagerup' principal graph pair. This completes the classification of irreducible amenable subfactors with index in the range…

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

We introduce a series of graph decompositions based on the modulator/target scheme of modification problems that enable several algorithmic applications that parametrically extend the algorithmic potential of planarity. In the core of our…

Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…

Let H be the 15- dimensional connected semisimple Lie group with its Iwasawa decomposition of H. Let G be the group of the semi direct product of H and the four dimensional real vector group . The goal of this paper is to define the Fourier…