Related papers: Sagbi combinatorics of maximal minors and a Sagbi …

Let $P(z)$ be a polynomial of degree $n$. In $2004$, Aziz and Rather \cite{aziz2004some} investigated the dependence of \[\bigg|P(Rz)-\alpha P(z)+\beta\biggl\{\biggl(\frac{R+1}{2}\biggr)^n-|\alpha|\biggr\}P(z)\bigg|, \ \text{for} \ z \in…

A notion of up and down Grover walks on simplicial complexes are proposed and their properties are investigated. These are abstract Szegedy walks, which is a special kind of unitary operators on a Hilbert space. The operators introduced in…

Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…

The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…

We complement the recent theory of general singular integrals $T$ invariant under the Zygmund dilations $(x_1, x_2, x_3) \mapsto (s x_1, tx_2, st x_3)$ by proving necessary and sufficient conditions for the boundedness and compactness of…

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

The support S of Sabbah's specialization complex is a simultaneous generalization of the set of eigenvalues of the monodromy on Deligne's nearby cycles complex, of the support of the Alexander modules of an algebraic knot, and of certain…

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…

Let $G$ be a finite simple group. By a theorem of Guralnick and Kantor, $G$ contains a conjugacy class $C$ such that for each non-identity element $x \in G$, there exists $y \in C$ with $G = \langle x,y\rangle$. Building on this deep…

Submodular optimization has received significant attention in both practice and theory, as a wide array of problems in machine learning, auction theory, and combinatorial optimization have submodular structure. In practice, these problems…

The Bernstein-Sato polynomial (or global b-function) is an important invariant in singularity theory, which can be computed using symbolic methods in the theory of D-modules. After surveying algorithms for computing the global b-function,…

As well known, permanent of a square (0,1)-matrix $A$ of order $n$ enumerates the permutations $\beta$ of $1,2,...,n$ with the incidence matrices $B\leq A.$ To obtain enumerative information on even and odd permutations with condition…

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…

We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…

We develop an optimal regularity theory for parabolic partial differential equations in weighted mixed norm Sobolev-Zygmund spaces. The results extend the classical Schauder estimates to coefficients that are merely measurable in time and…

Finding diverse solutions to optimization problems has been of practical interest for several decades, and recently enjoyed increasing attention in research. While submodular optimization has been rigorously studied in many fields, its…

Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…

The problem of distributed matrix multiplication with straggler tolerance over finite fields is considered, focusing on field sizes for which previous solutions were not applicable (for instance, the field of two elements). We employ…