相关论文: IPr* recurrence and nilsystems

We characterize permanence of planar S-systems. Further, we construct a planar S-system with three limit cycles.

We give a class of examples of $A$-hypergeometric systems that display integrality of mirror maps. Specifically, these systems have solutions $F(\lambda_1,\dots,\lambda_N) = 1$ and $\log\lambda^l + G(\lambda_1,\dots,\lambda_N)$ (for certain…

We give lower bounds in terms of~$n,$ for the number of limit cycles of polynomial vector fields of degree~$n,$ having any prescribed invariant algebraic curve. By applying them when the ovals of this curve are also algebraic limit cycles…

It is known that for an IP^{*} set A in (\mathbb{N},+) and a sequence \left\langle x_{n}\right\rangle _{n=1}^{\infty} in \mathbb{N}, there exists a sum subsystem \left\langle y_{n}\right\rangle _{n=1}^{\infty} of \left\langle…

We consider random fields admitting a spectral representation with infinitely divisible integrator and prove some of their properties.

We prove the Congruence Subgroup Property for two families of subgroups of Mapping Class Groups of finite-type surfaces. The first one is related to nilpotent quotients of the fundamental group and Johnson filtration, and along the way we…

A group is said to be C*-simple if its reduced C*-algebra is simple. We establish an intrinsic (group-theoretic) characterization of groups with this property. Specifically, we prove that a discrete group is C*-simple if and only if it has…

The strong recurrence is equivalent to the Riemann hypothesis. In the present paper, we give a simple proof of the generalized strong recurrence for all non-zero parameters.

We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…

We obtain complementary recurrence and transience criteria for processes $X=(X_n)_{n \ge 0}$ with values in $\mathbb R^d_+$ fulfilling a non-linear equation $X_{n+1}=MX_n+g(X_n)+ \xi_{n+1}$. Here $M$ denotes a primitive matrix having…

The study of sequences of polynomials satisfying high order recurrence relations is connected with the asymptotic behavior of multiple orthogonal polynomials, the convergence properties of type II Hermite-Pad\'e approximation, and…

A property of a recurrent neural network (RNN) is called \emph{extensional} if, loosely speaking, it is a property of the function computed by the RNN rather than a property of the RNN algorithm. Many properties of interest in RNNs are…

One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…

We derive the recurrence relations for relativistic Coulomb integrals directly from the integral representations with the help of computer algebra methods. In order to manage the computational complexity of this problem, we employ holonomic…

We present polygraphic programs, a subclass of Albert Burroni's polygraphs, as a computational model, showing how these objects can be seen as first-order functional programs. We prove that the model is Turing complete. We use polygraphic…

Polymorphism in programming languages enables code reuse. Here, we show that polymorphism has broad applicability far beyond computations for technical computing: parallelism in distributed computing, presentation of visualizations of…

The new property of minimal surfaces is obtained in this article.

We consider a family of nonlinear recurrences with the Laurent property. Although these recurrences are not generated by mutations in a cluster algebra, they fit within the broader framework of Laurent phenomenon algebras, as introduced…

We consider type inference for guarded recursive data types (GRDTs) -- a recent generalization of algebraic data types. We reduce type inference for GRDTs to unification under a mixed prefix. Thus, we obtain efficient type inference.…

Irreducible frequent patters (IFPs) are introduced for transactional databases. An IFP is such a frequent pattern (FP),(x1,x2,...xn), the probability of which, P(x1,x2,...xn), cannot be represented as a product of the probabilities of two…