15 results for "Igor Pak"
Showing 1–15 · 1.04 seconds · RSS
-
Journal Article
Determining the Efficiency of Cleaning Vehicle Exhaust Gases with an Ultrasonic Muffler Depending on the Engine Operating Mode and Ultrasound Power
The dependence has been obtained that links the degree of coagulation of soot particles, the parameters of the ultrasonic equipment, the geometric dimensions of the ultrasonic muffler, the frequency characteristics of ultrasound, and the parameters of the engine operating mode. In the paper is…
-
Journal Article
Cayley and Tutte polytopes
Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs. We extend this result to a two-variable deformations…
-
Journal Article
Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
Schubert Vanishing is a problem of deciding whether Schubert coefficients are zero. Until this work it was open whether this problem is in the polynomial hierarchy ${{\mathsf {PH}}}$ . We prove this problem is in ${{\mathsf {AM}}} \cap {{\mathsf {coAM}}}$ assuming the Generalized Riemann Hypothesis…
-
Journal Article
COMPLEXITY OF SHORT GENERATING FUNCTIONS
We give complexity analysis for the class of short generating functions. Assuming #P $\not \subseteq$ FP/poly, we show that this class is not closed under taking many intersections, unions or projections of generating functions, in the sense that these operations can increase the bit length of…
-
Journal Article
Geometry and complexity of O'Hara's algorithm
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we see that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we present a number of new complexity bounds, proving that O'Hara's bijection is efficient…
-
Journal Article
Equality cases of the Alexandrov–Fenchel inequality are not in the polynomial hierarchy
Describing the equality conditions of the Alexandrov–Fenchel inequality [Ale37] has been a major open problem for decades. We prove that in the case of convex polytopes, this description is not in the polynomial hierarchy unless the polynomial hierarchy collapses to a finite level. This is the…
-
Journal Article
Presburger Arithmetic with algebraic scalar multiplications
We consider Presburger arithmetic (PA) extended by scalar multiplication by an algebraic irrational number $\alpha$, and call this extension $\alpha$-Presburger arithmetic ($\alpha$-PA). We show that the complexity of deciding sentences in $\alpha$-PA is substantially harder than in PA. Indeed…
-
Journal Article
Kronecker coefficients: the tensor square conjecture and unimodality
We consider two aspects of Kronecker coefficients in the directions of representation theory and combinatorics. We consider a conjecture of Jan Saxl stating that the tensor square of the $S_n$-irreducible representation indexed by the staircase partition contains every irreducible representation of…
-
Journal Article
Hook formulas for skew shapes
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a positive sum over excited diagrams of products of hook-lengths. We…
-
Journal Article
Sorting probability for large Young diagrams
Sorting probability for large Young diagrams, Discrete Analysis 2021:24, 57 pp. Let $P=(X,\leq_P)$ be a finite partially ordered set (or _poset_, for short). A _linear extension_ $L$ of $P$ is a total ordering $\leq_L$ on $X$ such that for every $x,y\in X$, if $x\leq_Py$, then $x\leq_Ly$. It is an…
-
Journal Article
A direct bijective proof of the hook-length formula
This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity…
Also available at: DOAJ
-
Journal Article
Developing and Studying the Method of Ultrasonic Purification and Utilization of Internal Combustion Engine Exhaust Gases
A method of purification and utilization of internal combustion engine exhaust gases, due to the ultrasound impact on gases in a special storage tank, has been proposed. Large soot particles of gases due to coagulation are deposited on the bottom of the device and disposed of. The hypothesis of…
-
Journal Article
Theoretical and Experimental Study of Operation of the Tank Equipment for Ultrasonic Purification of the Internal Combustion Engine Exhaust Gases
The article presents results of scientific and experimental studies of the authors on operation of the tank equipment for ultrasonic purification of exhaust gases of internal combustion engines designed to reduce environmental pollution.The scheme of the experimental device implementing the…
-
Journal Article
Development of Calculation Methodology for Optimizing the Operating Mode of an Electric Pulse Unit for Cleaning Exhaust Gases
The results of research, devoted to operation of an electric pulse muffler designed for cleaning exhaust gases of an internal combustion engine, are presented in this article. The problem considered in this research is establishing the optimal operating mode of the electric pulse muffler by…