相关论文: Problems on neat embeddings solved by rainbow cons…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Drisko proved that $2n-1$ matchings of size $n$ in a bipartite graph have a rainbow matching of size $n$. For general graphs it is conjectured that $2n$ matchings suffice for this purpose (and that $2n-1$ matchings suffice when $n$ is…
We extend Grood's tableau construction of irreducible representations of the rook monoid and Steinberg's analogous result for the full transformation monoid. Our approach is characteristic-free and applies to any submonoid $\mathcal{M}(n)$…
An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…
We consider the conformal decomposition of Einstein's constraint equations introduced by Lichnerowicz and York, on a compact manifold with boundary. We use order relations on appropriate Banach spaces to derive weak solution generalizations…
We show that a real finite-dimensional unital associative algebra is naturally associated with a vector space of pseudo-Finsler norms whose members are linked to the algebra's space of normalized trace forms through an integral transform.…
In Part I of this article we generalize the Linearized Doubling (LD) approach, introduced in earlier work by NK, by proving a general theorem stating that if $\Sigma$ is a closed minimal surface embedded in a Riemannian three-manifold…
The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gr\"{o}bner) methods are severely limited by algorithmic issues…
We study the problem of minimizing the sum of three convex functions: a differentiable, twice-differentiable and a non-smooth term in a high dimensional setting. To this effect we propose and analyze a randomized block cubic Newton (RBCN)…
For finite-dimensional algebras over algebraically closed fields, we consider two fundamental classes of modules and their geometric counterparts: bricks and $\tau$-rigid modules, as well as brick components and $\tau$-regular components.…
The aims of this letter are three-fold: First is to show that nonlinear generalizations of electrodynamics support various types of knotted solutions in vacuum. The solutions are universal in the sense that they do not depend on the…
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma.…
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…
We study the representation theory of the rook-Brauer algebra RB_k(x), also called the partial Brauer algebra. This algebra has a basis of "rook-Brauer" diagrams, which are Brauer diagrams that allow for the possibility of missing edges.…
Graph Representation Learning (GRL) has experienced significant progress as a means to extract structural information in a meaningful way for subsequent learning tasks. Current approaches including shallow embeddings and Graph Neural…
Regular $A_n$-, $B_n$- and $C_n$-crystals are edge-colored directed graphs, with ordered colors $1,2,...,n$, which are related to representations of quantized algebras $U_q(\mathfrak{sl}_{n+1})$, $U_q(\mathfrak{sp}_{2n})$ and…
While Kronecker coefficients $g(\lambda,\mu,\nu)$ with bounded rows are polynomial-time computable via lattice-point methods, no explicit closed-form formulas have been obtained for genuinely three-row cases in the 87 years since…
Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…
The well-known classification of the Clifford algebras $Cl(r,s)$ leads to canonical forms of complex and real representations which are essentially unique by virtue of the Wedderburn theorem. For $s\ge 1$ representations of $Cl(r,s)$ on…
The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…