Related papers: Algebraic Degrees of Generalized Nash Equilibrium …
The critical point degree of a periodic graph operator is the number of critical points of its complex Bloch variety. Determining it is a step towards the spectral edges conjecture and more generally understanding Bloch varieties. Previous…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…
We perform numerical experiments on the Serre-Green-Naghdi (SGN) equations and a fully dispersive "Whitham-Green-Naghdi" (WGN) counterpart in dimension 1. In particular, solitary wave solutions of the WGN equations are constructed and their…
By Northcott's Theorem there are only finitely many algebraic points in affine $n$-space of fixed degree over a given number field and of height at most $X$. For large $X$ the asymptotics of these cardinalities have been investigated by…
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
We define the generalized basic hypergeometric polynomial of degree $N \geq 1$ in terms of the generalized basic hypergeometric function, which depends on (arbitrary, generic, possibly complex) parameters $q \neq 1$, the $r \geq 0$…
We show that the defining relations needed to describe a generalized q-Schur algebra as a quotient of a quantized enveloping algebra are determined completely by the defining ideal of a certain finite affine variety, the points of which…
A sufficient condition for the existence of a solution for generalized vector equilibrium problem (GVEP) on Hadamard manifold, by using a version of KKM lemma on this context, is presented in this paper. It is worth to point out that, in…
In this article, we study bounded-below locally finite $\mathbb{Z}$-graded algebras, which are referred to as commonly graded algebras in literature. Commonly graded algebras have almost similar theory as that of connected graded algebras,…
Machine learning, especially physics-informed neural networks (PINNs) and their neural network variants, has been widely used to solve problems involving partial differential equations (PDEs). The successful deployment of such methods…
A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number…
In this paper we continue our work on Schwartz functions and generalized Schwartz functions on Nash (i.e. smooth semi-algebraic) manifolds. Our first goal is to prove analogs of de-Rham theorem for de-Rham complexes with coefficients in…
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet…
We initiate the study of average intersection theory in real Grassmannians. We define the expected degree $\textrm{edeg} G(k,n)$ of the real Grassmannian $G(k,n)$ as the average number of real $k$-planes meeting nontrivially $k(n-k)$ random…
We contribute to the classification of Hopf algebras with finite Gelfand-Kirillov dimension, $\operatorname{GKdim}$ for short, through the study of Nichols algebras over abelian groups. We deal first with braided vector spaces over $\mathbb…
We introduce an algebraicity criteria. It has the following form: under certain conditions, an analytic subvariety of some algebriac variety over a global field $K$, if it contains many $K$-points, then it is algebraic over $K.$ This gives…
We address the generalized Nash equilibrium seeking problem in a partial-decision information scenario, where each agent can only exchange information with some neighbors, although its cost function possibly depends on the strategies of all…
The generalized number-theoretic transformation (NPT) is formulated on the basis of the exponential function theorem, which allows us to replace operations modulo the expression as a whole by modulo operations on the exponent of this…
In this paper, the generalized finite element method (GFEM) for solving second order elliptic equations with rough coefficients is studied. New optimal local approximation spaces for GFEMs based on local eigenvalue problems involving a…
This paper investigates the grokking phenomenon, which refers to the sudden transition from a long memorization to generalization observed during neural networks training, in the context of learning multiplication in finite-dimensional…