On the 1/3–2/3 Conjecture

Let (P, ≤) be a finite poset (partially ordered set), where P has cardinality n. Consider linear extensions of P as permutations x₁x₂?x_n in one-line notation. For distinct elements x, y ∈ P, we define ?(x ? y) to be the proportion of linear extensions of P in which x comes before y. For \(0\leq \alpha \leq \frac {1}{2}\), we say (x, y) is an α-balanced pair if α ≤ ?(x ? y) ≤?1 ? α. The 1/3–2/3 Conjecture states that every finite partially ordered set which is not a chain has a 1/3-balanced pair. We make progress on this conjecture by showing that it holds for certain families of posets. These include lattices such as the Boolean, set partition, and subspace lattices; partial orders that arise from a Young diagram; and some partial orders of dimension 2. We also consider various posets which satisfy the stronger condition of having a 1/2-balanced pair. For example, this happens when the poset has an automorphism with a cycle of length 2. Various questions for future research are posed.     

Boolean Lattices: Ramsey Properties and Embeddings

A subposet Q ^′ of a poset Q is a copy of a poset P if there is a bijection f between elements of P and Q ^′ such that x ≤ y in P iff f(x) ≤ f(y) in Q. For posets P, P ^′, let the poset Ramsey number R(P, P ^′) be the smallest N such that no matter how the elements of the Boolean lattice Q _N are colored red and blue, there is a copy of P with all red elements or a copy of P ^′ with all blue elements. We provide some general bounds on R(P, P ^′) and focus on the situation when P and P ^′ are both Boolean lattices. In addition, we give asymptotically tight bounds for the number of copies of Q _n in Q _N and for a multicolor version of a poset Ramsey number.     

Quasiplanar Diagrams and Slim Semimodular Lattices

For elements x and y in the (Hasse) diagram D of a finite bounded poset P, x is on the left of y, written as x λ y, if x and y are incomparable and x is on the left of all maximal chains through y. Being on the right, written as x ? y, is defined analogously. The diagram D is quasiplanar if λ and ? are transitive and for any pair (x,y) of incomparable elements, if x is on the left of some maximal chain through y, then x λ y. A planar diagram is quasiplanar, and P has a quasiplanar diagram iff its order dimension is at most 2. We are interested in diagrams only up to similarity. A finite lattice is slim if it is join-generated by the union of two chains. The main result gives a bijection between the set of (the similarity classes of) finite quasiplanar diagrams and that of (the similarity classes of) planar diagrams of finite slim semimodular lattices. This bijection allows one to describe finite posets of order dimension at most 2 by finite slim semimodular lattices, and conversely. As a corollary, we obtain that there are exactly (n?2)! quasiplanar diagrams of size n.     

The Folded (2<Emphasis Type="Italic">D</Emphasis> + 1)-cube and Its Uniform Posets

Let Γ denote the folded (2D + 1)-cube with vertex set X and diameter D ≥ 3. Fix x ∈ X. We first define a partial order ≤ on X as follows. For y, z ∈ X let y ≤ z whenever ?(x, y) + ?(y, z) = ?(x, z). Let R (resp. L) denote the raising matrix (resp. lowering matrix) of Γ. Next we show that there exists a certain linear dependency among RL², LRL,L²R and L for each given Q-polynomial structure of Γ. Finally, we determine whether the above linear dependency structure gives this poset a uniform structure or strongly uniform structure.     

Conditional equations for quadratic functions

We consider quadratic functions f that satisfy the additional equation y² f(x) =  x² f(y) for the pairs \({ (x,y) \in \mathbb{R}^2}\) that fulfill the condition P(x, y) =  0 for some fixed polynomial P of two variables. If P(x, y) =  ax +  by +  c with \({ a , b , c \in \mathbb{R}}\) and \({(a^2 + b^2)c \neq 0}\) or P(x,y) =  x ⁿ ? y with a natural number \({n \geq 2}\), we prove that f(x) =  f(1) x² for all \({x \in \mathbb{R}}\). Some related problems, admitting quadratic functions generated by derivations, are considered as well.     

On power series representing solutions of the one-dimensional time-independent Schrödinger equation

For the equation χ″(x) = u(x)χ(x) with infinitely smooth u(x), the general solution χ(x) is found in the form of a power series. The coefficients of the series are expressed via all derivatives u ^(m)(y) of the function u(x) at a fixed point y. Examples of solutions for particular functions u(x) are considered.     

On Lie’s problem and differential invariants of ODEs <Emphasis Type="Italic">y</Emphasis>″ = <Emphasis Type="Italic">F</Emphasis>(<Emphasis Type="Italic">x</Emphasis>, <Emphasis Type="Italic">y</Emphasis>)

A point classification of ordinary differential equations of the form y″ = F(x, y) is considered. The algebra of differential invariants of the action of the point symmetry pseudogroup on the right-hand sides of equations of the form y″ = F(x, y) is calculated, and Lie’s problem on the point equivalence of such equations is solved.     

Varieties of Birkhoff Systems Part II

This is the second part of a two-part paper on Birkhoff systems. A Birkhoff system is an algebra that has two binary operations ? and + , with each being commutative, associative, and idempotent, and together satisfying x?(x + y) = x+(x?y). The first part of this paper described the lattice of subvarieties of Birkhoff systems. This second part continues the investigation of subvarieties of Birkhoff systems. The 4-element subdirectly irreducible Birkhoff systems are described, and the varieties they generate are placed in the lattice of subvarieties. The poset of varieties generated by finite splitting bichains is described. Finally, a structure theorem is given for one of the five covers of the variety of distributive Birkhoff systems, the only cover that previously had no structure theorem. This structure theorem is used to complete results from the first part of this paper describing the lower part of the lattice of subvarieties of Birkhoff systems.     

Some minimax problems in lexicographic order

In this paper, minimax theorems and saddle points for a class of vector-valued mappings f(x, y) = u(x)+β(x)v(y) are first investigated in the sense of lexicographic order, where u, v are two general vector-valued mappings and β is a non-negative real-valued function. Then, by applying the existence theorem of lexicographic saddle point, we investigate a lexicographic equilibrium problem and establish an equivalent relationship between the lexicographic saddle point theorem and existence theorem of a lexicographic equilibrium problem for vector-valued mappings.     

On the Cauchy problem for an Emden-Fowler equation

We consider the equation y″ = P(x)x ^a y ^σ , σ < 0, and prove the unique solvability of the Cauchy problem y(0) = 0, y′(0) = λ.     

Heat Kernels for Isotropic-Like Markov Generators on Ultrametric Spaces: a Survey

Let (X, d) be a locally compact separable ultrametric space. Let D be the set of all locally constant functions having compact support. Given a measure m and a symmetric function J(x, y) we consider the linear operator L^Jf(x) = ∫(f(x) ? f(y)) J(x, y)dm(y) defined on the set D. When J(x, y) is isotropic and satisfies certain conditions, the operator (?L^J, D) acts in L²(X,m), is essentially self-adjoint and extends as a self-adjoint Markov generator, its Markov semigroup admits a continuous heat kernel p^J (t, x, y). When J(x, y) is not isotropic but uniformly in x, y is comparable to isotropic function J(x, y) as above the operator (?L^J, D) extends in L²(X,m) as a self-adjointMarkov generator, its Markov semigroup admits a continuous heat kernel p^J(t, x, y), and the function p^J(t, x, y) is uniformly comparable in t, x, y to the function p^J(t, x, y), the heat kernel related to the operator (?L^J,D).     

Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems

In this paper we present a new algorithm for solving polynomial equations based on the Taylor series of the inverse function of a polynomial, f _P (y). The foundations of the computing of such series have been previously developed by the authors in some recent papers, proceeding as follows: given a polynomial function \(y=P(x)=a_0+a_1x+\cdots+a_mx^m\), with \(a_i \in \mathcal{R}, 0 \leq i \leq m\), and a real number u so that P′(u)?≠?0, we have got an analytic function f _P (y) that satisfies x?=?f _P (P(x)) around x?=?u. Besides, we also introduce a new proof (completely different) of the theorems involves in the construction of f _P (y), which provide a better radius of convergence of its Taylor series, and a more general perspective that could allow its application to other kinds of equations, not only polynomials. Finally, we illustrate with some examples how f _P (y) could be used for solving polynomial systems. This question has been already treated by the authors in preceding works in a very complex and hard way, that we want to overcome by using the introduced algorithm in this paper.     

Varieties of Birkhoff Systems Part I

A Birkhoff system is an algebra that has two binary operations ? and + , with each being commutative, associative, and idempotent, and together satisfying x?(x + y) = x+(x?y). Examples of Birkhoff systems include lattices, and quasilattices, with the latter being the regularization of the variety of lattices. A number of papers have explored the bottom part of the lattice of subvarieties of Birkhoff systems, in particular the role of meet and join distributive Birkhoff systems. Our purpose in this note is to further explore the lattice of subvarieties of Birkhoff systems. A primary tool is consideration of splittings and finite bichains, Birkhoff systems whose join and meet reducts are both chains. We produce an infinite family of subvarieties of Birkhoff systems generated by finite splitting bichains, and describe the poset of these subvarieties. Consideration of these splitting varieties also allows us to considerably extend knowledge of the lower part of the lattice of subvarieties of Birkhoff systems     

Invariance of Picard Dimensions Under Basic Perturbations

The Picard dimension \(\dim \mu\) of a signed Radon measure μ on the punctured closed unit ball 0?x|?≦?1 in the d-dimensional euclidean space with d?≧?2 is the cardinal number of the set of extremal rays of the cone of positive continuous distributional solutions u of the Schrödinger equation (???Δ?+?μ)u?=?0 on the punctured open unit ball 0?x|?x|?=?1. If the Green function of the above equation on 0?x|?Δ?+?μ)u?=?δ _y , the Dirac measure supported by the point y, exists for every y in 0?x|?μ is referred to as being hyperbolic on 0?x|?γ is a radial Radon measure which is both positive and absolutely continuous with respect to the d-dimensional Lebesgue measure dx whose Radon–Nikodym density dγ(x)/dx is bounded by a positive constant multiple of |x|^???2. The purpose of this paper is to show that the Picard dimensions of hyperbolic radial Radon measures μ are invariant under basic perturbations \(\gamma: \dim(\mu+\gamma)=\dim\mu\). Three applications of this invariance are also given.     

On the strong Brillinger-mixing property of α-determinantal point processes and some applications

First, we derive a representation formula for all cumulant density functions in terms of the non-negative definite kernel function C(x, y) defining an α-determinantal point process (DPP). Assuming absolute integrability of the function C₀(x) = C(o, x), we show that a stationary α-DPP with kernel function C₀(x) is “strongly” Brillinger-mixing, implying, among others, that its tail-σ-field is trivial. Second, we use this mixing property to prove rates of normal convergence for shot-noise processes and sketch some applications to statistical second-order analysis of α-DPPs.     

On the Stability of a k-Cubic Functional Equation in Intuitionistic Fuzzy n-Normed Spaces

In this paper, we investigate some stability results concerning the k-cubic functional equation f(kx + y) + f(kx?y) = kf(x + y) + kf(x?y) + 2k(k²?1)f(x) in the intuitionistic fuzzy n-normed spaces.     

Partial Order Embeddings with Convex Range

A careful study is made of embeddings of posets which have a convex range. We observe that such embeddings share nice properties with the homomorphisms of more restrictive categories; for example, we show that every order embedding between two lattices with convex range is a continuous lattice homomorphism. A number of posets are considered; for one of the simplest examples, we prove that every product order embedding σ : ?^? → ?^? with convex range is of the form

$$ \sigma(x)(n)=\left( (x\circ g_{\sigma})+y_{\sigma}\right)(n) ~~~~\text{if}~ n\in K_{\sigma}, $$

(1)

and σ(x)(n) = y _σ (n) otherwise, for all x ∈ ?^?, where K _σ ? ?, g _σ : K _σ → ? is a bijection and y _σ ∈ ?^?. The most complex poset examined here is the quotient of the lattice of Baire measurable functions, with codomain of the form ? ^I for some index set I, modulo equality on a comeager subset of the domain, with its ‘natural’ ordering.

     

Annihilating and power-commuting generalized skew derivations on lie ideals in prime rings

Let R be a prime ring of characteristic different from 2 and 3, Q_r its right Martindale quotient ring, C its extended centroid, L a non-central Lie ideal of R and n ≥ 1 a fixed positive integer. Let α be an automorphism of the ring R. An additive map D: R → R is called an α-derivation (or a skew derivation) on R if D(xy) = D(x)y + α(x)D(y) for all x, y ∈ R. An additive mapping F: R → R is called a generalized α-derivation (or a generalized skew derivation) on R if there exists a skew derivation D on R such that F(xy) = F(x)y + α(x)D(y) for all x, y ∈ R.     

Counting Split Semiorders

A poset P=(X,) is a split semiorder if a unit interval and a distinguished point in that interval can be assigned to each xX so that xy precisely when x's distinguished point precedes y's interval, and y's distinguished point follows x's interval. For each |X|10, we count the split semiorders and identify all posets that are minimal forbidden posets for split semiorders.     

Hyperquasipolynomials for the Theta-Function

Let g be a linear combination with quasipolynomial coefficients of shifts of the Jacobi theta function and its derivatives in the argument. All entire functions f: ? → ? satisfying f(x+y)g(x?y) = α₁(x)β₁(y)+· · ·+α_r(x)β_r(y) for some r ∈ ? and α_j, β_j: ? → ? are described.