相关论文: Conjugacy between polynomial basins

We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

Modelled on efficient algorithms for solving the conjugacy problem in hyperbolic groups, we define and study the permutation conjugacy length function. This function estimates the length of a short conjugator between words $u$ and $v$, up…

The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…

The interaction between combinatorics and algebraic and differential geometry is very strong. While researching a problem of Hessian topology, we came across a series of identities of binomial coefficients, which are useful for proving a…

We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…

Using the notion of short natural directed path, we introduce the homotopy branching space of a precubical set. It is unique only up to homotopy equivalence. We prove that, for any precubical set, it is homotopy equivalent to the branching…

Let $H$ be an extension of a finite group $Q$ by a finite group $G$. Inspired by the results of duality theorems for \'etale gerbes on orbifolds, we describe the number of conjugacy classes of $H$ that maps to the same conjugacy class of…

The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…

We say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups…

We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly…

We investigate the following question: how close can two disjoint lattice polytopes contained in a fixed hypercube be? This question stems from various contexts where the minimal distance between such polytopes appears in complexity bounds…

In this paper, we will discuss the notion of almost orthogonality in a functional sequence.Especially, we will define a few sequences of almost orthogonal polynomials which can be used successfully for modeling of electronic systems which…

The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…

Certain monotonicity properties of the Poisson approximation to the binomial distribution are established. As a natural application of these results, exact (rather than approximate) tests of hypotheses on an unknown value of the parameter…

Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…

For given polynomial map $F:\C^2\to\C^2$ with nonvanishing jacobian we associate a variety whose homology or intersection homology describes the geometry of singularities at infinity of this map.

Compatibility conditions are investigated for planar network structures consisting of nodes and connecting bars; these conditions restrict the elongations of bars and are analogous to the compatibility conditions of deformation in continuum…

In earlier work we introduced topologically minimal surfaces as the analogue of geometrically minimal surfaces. Here we strengthen the analogy by showing that complicated amalgamations act as barriers to low genus, topologically minimal…

We compute symplectic cohomology for Milnor fibres of certain compound Du Val singularities that admit small resolution by using homological mirror symmetry. Our computations suggest a new conjecture that the existence of a small resolution…