相关论文: An Algorithm to List All the Fixed-Point Free Invo…
Moments are expectation values of products of powers of position and momentum, taken over quantum states (or averages over a set of classical particles). For free particles, the evolution in the quantum case is closely related to that of a…
We investigate the representation of the symmetric group afforded by the action on its conjugacy class of fixed point free involutions, over an algebraically closed field of finite characteristic p. We discuss the general form of the set of…
$\beta(1,0)$-trees provide a convenient description of rooted non-separable planar maps. The involution $h$ on $\beta(1,0)$-trees was introduced to prove a complicated equidistribution result on a class of pattern-avoiding permutations. In…
We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
For a finite group generated by involutions, the involution width is defined to be the minimal $k\in\mathbb{N}$ such that any group element can be written as a product of at most $k$ involutions. We show that the involution width of every…
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the algebraic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras…
We give various formulas to compute the number of all involutions, i.e. elements of order 2, in an incidence algebra $I(X,\mathbb{K})$, where $X$ is a finite poset (star, Y and Rhombuses) and $\mathbb{K}$ is a finite field of characteristic…
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations…
Define $I_n^k(\alpha)$ to be the set of involutions of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_i$, for some $i \geq 2$, and define $I_n^k(\emptyset;\alpha)$ to be the set of involutions of…
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the alge- braic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras…
Wilf partitions are partitions of an integer $n$ in which all nonzero multiplicities are distinct. On his webpage, the late Herbert Wilf posed the problem to find "any interesting theorems" about the number f(n) of those partitions.…
We develop a theoretical framework for computer-assisted proofs of the existence of invariant objects in semilinear PDEs. The invariant objects considered in this paper are equilibrium points, traveling waves, periodic orbits and invariant…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Bicubic maps are in bijection with \beta(0,1)-trees. We introduce two new ways of decomposing \beta(0,1)-trees. Using this we define an endofunction on \beta(0,1)-trees, and thus also on bicubic maps. We show that this endofunction is in…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
An efficient and flexible engine for computing fixed points is critical for many practical applications. In this paper, we firstly present a goal-directed fixed point computation strategy in the logic programming paradigm. The strategy…
This work introduces and analyzes a finite element scheme for evolution problems involving fractional-in-time and in-space differentiation operators up to order two. The left-sided fractional-order derivative in time we consider is employed…
This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…
In this article we introduce powerful tools and techniques from invariant theory to free analysis. This enables us to study free maps with involution. These maps are free noncommutative analogs of real analytic functions of several…