Related papers: Semi-simplicial combinatorics of cyclinders and su…
We introduce the notion of a pseudomultiplier of a Hilbert space $\mathcal H$ of functions on a set $\Omega$. Roughly, a pseudomultiplier of $\mathcal H$ is a function which multiplies a finite-codimensional subspace of $\mathcal H$ into…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
In this paper we give a construction for a special type of congruences on commutative semigroups. We apply our result for the multiplicative semigroup of all positive integers.
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
We give a specific cylinder functor for semifree dg categories. This allows us to construct a homotopy colimit functor explicitly. These two functors are "computable", specifically, the constructed cylinder functor sends a dg category of…
We derive the action for chiral spinor multiplets coupled to vector and scalar multiplets. We give the component form of the action, which contains gauge invariant mass terms for the antisymmetric tensors in the spinor superfield and…
An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…
Let $k$ be a commutative $\mathbb{Q}$-algebra. We study families of functors between categories of finitely generated $R$-modules which are defined for all commutative $k$-algebras $R$ simultaneously and are compatible with base changes.…
We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in…
The notion of mixed representations of quivers can be derived from ordinary quiver representations by considering the dual action of groups on "vertex" vector spaces together with the usual action. A generating system for the algebra of…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
Let k be an algebraically closed field of characteristic zero and let B be a finitely generated k-domain. We study semisimple derivations on B, with special emphasis on those whose eigenvalues are integers. For such derivations, after…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
We investigate categorical and amalgamation properties of the functor Idc assigning to every partially ordered abelian group G its semilattice of compact ideals Idc G. Our main result is the following. Theorem 1. Every diagram of finite…
The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…
Subdifferentials (in the sense of convex analysis) of matrix-valued functions defined on $\mathbb{R}^d$ that are convex with respect to the L\"{o}wner partial order can have a complicated structure and might be very difficult to compute…
In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…