Related papers: Constructing Extended Formulations from Reflection…
The polyhedral realizations for crystal bases of the integrable highest weight modules of $U_q(\mathfrak{g})$ have been introduced in ([T.Nakashima, J. Algebra, vol.219, no. 2, (1999)]), which describe the crystal bases as sets of lattice…
The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the plane. First, we give a new proof that the…
In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real-world applications. We derive a class of strong valid…
Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…
Let H be any reductive p-adic group. We introduce a notion of cuspidality for enhanced Langlands parameters for H, which conjecturally puts supercuspidal H-representations in bijection with such L-parameters. We also define a cuspidal…
We give a general procedure to construct algebro-geometric Feynman rules, that is, characters of the Connes-Kreimer Hopf algebra of Feynman graphs that factor through a Grothendieck ring of immersed conical varieties, via the class of the…
Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…
Direct search is one of the most popular derivative-free optimization paradigms, that relies on exploring the variable space using polling directions. To analyze and implement direct search, one typically relies on positive spanning sets.…
In this paper, we construct several new permutation polynomials over finite fields. First, using the linearized polynomials, we construct the permutation polynomial of the form $\sum_{i=1}^k(L_{i}(x)+\gamma_i)h_i(B(x))$ over ${\bf…
This work presents a unified framework that combines global approximations with locally built models to handle challenging nonconvex and nonsmooth composite optimization problems, including cases involving extended real-valued functions. We…
We introduce higher-dimensional analogs of Kazhdan projections in matrix algebras over group $C^*$-algebras and Roe algebras. These projections are constructed in the framework of cohomology with coefficients in unitary representations and…
Applications of a method recently suggested by one of the authors (R.L.) are presented. This method is based on the use of dimensional recurrence relations and analytic properties of Feynman integrals as functions of the parameter of…
In [LWY23] the authors construct the reflective center of a module category M over a braided monoidal category B. The reflective center is by construction a braided module category over B. In the case where B is the category of modules over…
An algorithm for calculating two-loop propagator type Feynman diagrams with arbitrary masses and external momentum is proposed. Recurrence relations allowing to express any scalar integral in terms of basic integrals are given. A minimal…
We will pursue a way of building up an algebraic structure that involves, in a mathematical abstract way, the well known Grassmann variables. The problem arises when we tried to understand the grassmannian polynomial expansion on the scope…
We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…
We continue our study of Hilbert space representations of the Reflection Equation Algebra, again focusing on the algebra constructed from the $R$-matrix associated to the $q$-deformation of $GL(N,\mathbb{C})$ for $0<q<1$. We develop a form…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
We give characterizations of Gorenstein projective, Gorenstein flat and Gorenstein injective modules over the group algebra for large families of infinite groups and show that every weak Gorenstein projective, weak Gorenstein flat and weak…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…